./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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_2821f46c-3877-4b17-b9b0-6698d72d5190/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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:05:24,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:05:24,675 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 12:05:24,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:05:24,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:05:24,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:05:24,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:05:24,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:05:24,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:05:24,730 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:05:24,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:05:24,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:05:24,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:05:24,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:05:24,734 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:05:24,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:05:24,735 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:05:24,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:05:24,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:05:24,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:05:24,738 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:05:24,738 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:05:24,739 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:05:24,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:05:24,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:05:24,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:05:24,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:05:24,741 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:05:24,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:05:24,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:05:24,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:05:24,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:05:24,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:24,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:05:24,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:05:24,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:05:24,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:05:24,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:05:24,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:05:24,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:05:24,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:05:24,746 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_2821f46c-3877-4b17-b9b0-6698d72d5190/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_2821f46c-3877-4b17-b9b0-6698d72d5190/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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2023-11-26 12:05:25,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:05:25,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:05:25,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:05:25,097 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:05:25,097 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:05:25,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2023-11-26 12:05:28,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:05:28,746 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:05:28,746 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2023-11-26 12:05:28,770 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data/c7d9c2c20/08021d9b34984b9da3a61f176d988e19/FLAG26b4c5cdf [2023-11-26 12:05:28,794 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data/c7d9c2c20/08021d9b34984b9da3a61f176d988e19 [2023-11-26 12:05:28,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:05:28,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:05:28,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:28,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:05:28,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:05:28,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2016a434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:28, skipping insertion in model container [2023-11-26 12:05:28,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:28" (1/1) ... [2023-11-26 12:05:28,905 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:05:29,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:29,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:05:29,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:29,682 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:29,682 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:29,691 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:05:29,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29 WrapperNode [2023-11-26 12:05:29,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:29,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:29,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:05:29,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:05:29,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,810 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-11-26 12:05:29,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:29,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:05:29,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:05:29,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:05:29,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,877 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 12:05:29,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:05:29,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:05:29,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:05:29,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:05:29,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (1/1) ... [2023-11-26 12:05:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:29,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:05:30,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:05:30,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:05:30,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:05:30,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:05:30,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:05:30,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:05:30,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:05:30,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:05:30,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:05:30,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:05:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:05:30,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:05:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:05:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:05:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:05:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:05:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:05:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:05:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:05:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:05:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:05:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:05:30,023 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 12:05:30,189 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:05:30,192 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:05:30,549 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:05:30,810 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:05:30,811 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:05:30,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:30 BoogieIcfgContainer [2023-11-26 12:05:30,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:05:30,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:05:30,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:05:30,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:05:30,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:28" (1/3) ... [2023-11-26 12:05:30,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592ff739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:30, skipping insertion in model container [2023-11-26 12:05:30,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:29" (2/3) ... [2023-11-26 12:05:30,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592ff739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:30, skipping insertion in model container [2023-11-26 12:05:30,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:30" (3/3) ... [2023-11-26 12:05:30,825 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2023-11-26 12:05:30,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:05:30,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 12:05:30,847 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:05:30,936 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:05:30,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 12:05:31,012 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-26 12:05:31,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:05:31,016 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 5. Compared 97 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 12:05:31,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 12:05:31,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-26 12:05:31,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:05:31,037 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;@4e06242e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:05:31,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 12:05:31,041 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:05:31,042 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:05:31,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:05:31,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:31,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:05:31,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:31,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 13019, now seen corresponding path program 1 times [2023-11-26 12:05:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575845693] [2023-11-26 12:05:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:31,424 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 12:05:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575845693] [2023-11-26 12:05:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575845693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:31,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:31,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:05:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252915693] [2023-11-26 12:05:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:31,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:31,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:31,506 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 12:05:31,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:31,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:31,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:31,902 INFO L124 PetriNetUnfolderBase]: 557/1141 cut-off events. [2023-11-26 12:05:31,902 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 12:05:31,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1141 events. 557/1141 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8355 event pairs, 413 based on Foata normal form. 72/1136 useless extension candidates. Maximal degree in co-relation 2013. Up to 647 conditions per place. [2023-11-26 12:05:31,923 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 12:05:31,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 179 flow [2023-11-26 12:05:31,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:31,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:31,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:31,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:31,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:31,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:31,949 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 12:05:31,956 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 12:05:31,956 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 12:05:31,959 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:31,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 179 flow [2023-11-26 12:05:31,963 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 12:05:31,971 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 12:05:31,973 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 12:05:31,978 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 12:05:31,978 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 12:05:31,979 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 12:05:31,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:31,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:05:31,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:05:31,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:31,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 13020, now seen corresponding path program 1 times [2023-11-26 12:05:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026607789] [2023-11-26 12:05:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:32,198 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 12:05:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:32,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026607789] [2023-11-26 12:05:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026607789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:32,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:05:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348275712] [2023-11-26 12:05:32,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:32,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:32,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:32,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:32,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:05:32,223 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 12:05:32,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:32,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:05:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:32,531 INFO L124 PetriNetUnfolderBase]: 557/1140 cut-off events. [2023-11-26 12:05:32,532 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 12:05:32,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1140 events. 557/1140 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8392 event pairs, 413 based on Foata normal form. 1/1064 useless extension candidates. Maximal degree in co-relation 2049. Up to 646 conditions per place. [2023-11-26 12:05:32,544 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 12:05:32,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-26 12:05:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:32,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:32,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:32,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:32,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:32,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:32,549 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 12:05:32,550 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 12:05:32,551 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 12:05:32,551 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:32,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-26 12:05:32,554 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 12:05:32,556 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 12:05:32,556 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 12:05:32,557 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 12:05:32,558 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 12:05:32,558 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 12:05:32,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:32,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:05:32,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:05:32,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:32,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash 388244862, now seen corresponding path program 1 times [2023-11-26 12:05:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999725678] [2023-11-26 12:05:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:32,622 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 12:05:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999725678] [2023-11-26 12:05:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999725678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:32,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983770774] [2023-11-26 12:05:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:32,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:32,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:32,646 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 12:05:32,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:32,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:32,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:32,899 INFO L124 PetriNetUnfolderBase]: 558/1138 cut-off events. [2023-11-26 12:05:32,900 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 12:05:32,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 1138 events. 558/1138 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8318 event pairs, 413 based on Foata normal form. 0/1065 useless extension candidates. Maximal degree in co-relation 2050. Up to 646 conditions per place. [2023-11-26 12:05:32,930 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 12:05:32,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-26 12:05:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-26 12:05:32,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-26 12:05:32,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-26 12:05:32,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-26 12:05:32,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:32,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-26 12:05:32,935 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 12:05:32,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 12:05:32,937 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 12:05:32,937 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 115 transitions. [2023-11-26 12:05:32,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-26 12:05:32,939 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 12:05:32,940 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 12:05:32,941 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 12:05:32,942 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-26 12:05:32,942 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 12:05:32,942 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 12:05:32,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:32,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:05:32,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:05:32,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:32,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 388244863, now seen corresponding path program 1 times [2023-11-26 12:05:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240963236] [2023-11-26 12:05:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:33,088 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 12:05:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240963236] [2023-11-26 12:05:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240963236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643130996] [2023-11-26 12:05:33,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:33,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:33,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:33,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:33,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:05:33,110 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 12:05:33,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:33,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:05:33,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:33,351 INFO L124 PetriNetUnfolderBase]: 557/1136 cut-off events. [2023-11-26 12:05:33,351 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 12:05:33,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1136 events. 557/1136 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8273 event pairs, 334 based on Foata normal form. 2/1066 useless extension candidates. Maximal degree in co-relation 2047. Up to 643 conditions per place. [2023-11-26 12:05:33,363 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-26 12:05:33,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-26 12:05:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:33,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:33,366 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:33,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:33,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:33,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:33,367 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 12:05:33,368 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 12:05:33,369 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 12:05:33,369 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:33,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-26 12:05:33,371 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 12:05:33,372 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 12:05:33,373 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 12:05:33,374 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-26 12:05:33,374 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 12:05:33,374 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 12:05:33,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:33,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:33,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:05:33,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:33,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash -143850721, now seen corresponding path program 1 times [2023-11-26 12:05:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821151111] [2023-11-26 12:05:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:33,441 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 12:05:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:33,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821151111] [2023-11-26 12:05:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821151111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017786233] [2023-11-26 12:05:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:33,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:33,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:33,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:33,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:33,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 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 12:05:33,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:33,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:33,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:33,693 INFO L124 PetriNetUnfolderBase]: 564/1120 cut-off events. [2023-11-26 12:05:33,694 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 12:05:33,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 1120 events. 564/1120 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7800 event pairs, 427 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 2044. Up to 644 conditions per place. [2023-11-26 12:05:33,707 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-26 12:05:33,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-26 12:05:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-26 12:05:33,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-26 12:05:33,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-26 12:05:33,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-26 12:05:33,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:33,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-26 12:05:33,711 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 12:05:33,712 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 12:05:33,712 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 12:05:33,712 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 115 transitions. [2023-11-26 12:05:33,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-26 12:05:33,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:33,716 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-26 12:05:33,716 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=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 12:05:33,717 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 12:05:33,717 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-26 12:05:33,718 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 12:05:33,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:33,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:33,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:05:33,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:33,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash -143850720, now seen corresponding path program 1 times [2023-11-26 12:05:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:33,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570738060] [2023-11-26 12:05:33,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:33,801 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 12:05:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:33,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570738060] [2023-11-26 12:05:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570738060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:33,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:33,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542784277] [2023-11-26 12:05:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:33,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:33,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:33,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:05:33,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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 12:05:33,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:33,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:05:33,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:34,059 INFO L124 PetriNetUnfolderBase]: 557/1124 cut-off events. [2023-11-26 12:05:34,059 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-26 12:05:34,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1124 events. 557/1124 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8043 event pairs, 238 based on Foata normal form. 6/1074 useless extension candidates. Maximal degree in co-relation 2039. Up to 631 conditions per place. [2023-11-26 12:05:34,071 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-26 12:05:34,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 168 flow [2023-11-26 12:05:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:34,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:34,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:34,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:34,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:34,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:34,075 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 12:05:34,076 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 12:05:34,076 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 12:05:34,076 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:34,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 168 flow [2023-11-26 12:05:34,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:34,079 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-26 12:05:34,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-26 12:05:34,081 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-26 12:05:34,081 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-26 12:05:34,081 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 12:05:34,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:34,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:34,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:05:34,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:34,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:34,083 INFO L85 PathProgramCache]: Analyzing trace with hash 920930867, now seen corresponding path program 1 times [2023-11-26 12:05:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894262183] [2023-11-26 12:05:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:34,239 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 12:05:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894262183] [2023-11-26 12:05:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894262183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:34,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:34,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:05:34,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235954618] [2023-11-26 12:05:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:34,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:34,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-26 12:05:34,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:34,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:34,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-26 12:05:34,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:34,475 INFO L124 PetriNetUnfolderBase]: 459/876 cut-off events. [2023-11-26 12:05:34,475 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 12:05:34,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 876 events. 459/876 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5808 event pairs, 67 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1639. Up to 585 conditions per place. [2023-11-26 12:05:34,484 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-11-26 12:05:34,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 174 flow [2023-11-26 12:05:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:05:34,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2023-11-26 12:05:34,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:05:34,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:05:34,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:34,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:05:34,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:34,488 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 12:05:34,488 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 12:05:34,489 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:05:34,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 174 flow [2023-11-26 12:05:34,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:34,491 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2023-11-26 12:05:34,491 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=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-26 12:05:34,492 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-26 12:05:34,492 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2023-11-26 12:05:34,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:34,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:34,493 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 12:05:34,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:05:34,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:34,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2012172795, now seen corresponding path program 1 times [2023-11-26 12:05:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808073799] [2023-11-26 12:05:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808073799] [2023-11-26 12:05:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808073799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:05:35,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629600652] [2023-11-26 12:05:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:35,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:05:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:05:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:05:35,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 12:05:35,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:35,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:35,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 12:05:35,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:35,803 INFO L124 PetriNetUnfolderBase]: 401/784 cut-off events. [2023-11-26 12:05:35,803 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-26 12:05:35,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 784 events. 401/784 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5064 event pairs, 116 based on Foata normal form. 30/809 useless extension candidates. Maximal degree in co-relation 1467. Up to 324 conditions per place. [2023-11-26 12:05:35,811 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 28 selfloop transitions, 4 changer transitions 9/59 dead transitions. [2023-11-26 12:05:35,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 212 flow [2023-11-26 12:05:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:05:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:05:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2023-11-26 12:05:35,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-11-26 12:05:35,818 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 231 transitions. [2023-11-26 12:05:35,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 231 transitions. [2023-11-26 12:05:35,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:35,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 231 transitions. [2023-11-26 12:05:35,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:35,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:35,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:35,822 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 7 states and 231 transitions. [2023-11-26 12:05:35,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 212 flow [2023-11-26 12:05:35,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:35,825 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 90 flow [2023-11-26 12:05:35,825 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-11-26 12:05:35,829 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 12:05:35,829 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 90 flow [2023-11-26 12:05:35,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:35,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:35,830 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 12:05:35,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:05:35,830 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:35,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2012174133, now seen corresponding path program 1 times [2023-11-26 12:05:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825957332] [2023-11-26 12:05:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:36,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 12:05:36,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825957332] [2023-11-26 12:05:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825957332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:36,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958475989] [2023-11-26 12:05:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:36,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:36,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:36,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 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 12:05:36,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:36,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:36,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:36,428 INFO L124 PetriNetUnfolderBase]: 514/973 cut-off events. [2023-11-26 12:05:36,428 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-26 12:05:36,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 973 events. 514/973 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6653 event pairs, 121 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1847. Up to 364 conditions per place. [2023-11-26 12:05:36,436 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 23 selfloop transitions, 2 changer transitions 31/74 dead transitions. [2023-11-26 12:05:36,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 278 flow [2023-11-26 12:05:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:05:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:05:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 282 transitions. [2023-11-26 12:05:36,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2023-11-26 12:05:36,439 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 282 transitions. [2023-11-26 12:05:36,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 282 transitions. [2023-11-26 12:05:36,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:36,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 282 transitions. [2023-11-26 12:05:36,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:36,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 54.0) internal successors, (486), 9 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:36,443 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 54.0) internal successors, (486), 9 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:36,443 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 90 flow. Second operand 8 states and 282 transitions. [2023-11-26 12:05:36,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 278 flow [2023-11-26 12:05:36,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 269 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 12:05:36,446 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 97 flow [2023-11-26 12:05:36,446 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-26 12:05:36,447 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2023-11-26 12:05:36,447 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 97 flow [2023-11-26 12:05:36,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 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 12:05:36,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:36,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:36,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:05:36,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:36,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash -996539935, now seen corresponding path program 1 times [2023-11-26 12:05:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:36,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716298043] [2023-11-26 12:05:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:36,823 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 12:05:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716298043] [2023-11-26 12:05:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716298043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:36,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:05:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185508779] [2023-11-26 12:05:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:36,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 12:05:36,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:36,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:36,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 12:05:36,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:37,622 INFO L124 PetriNetUnfolderBase]: 1622/3072 cut-off events. [2023-11-26 12:05:37,622 INFO L125 PetriNetUnfolderBase]: For 643/643 co-relation queries the response was YES. [2023-11-26 12:05:37,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 3072 events. 1622/3072 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22170 event pairs, 99 based on Foata normal form. 78/3128 useless extension candidates. Maximal degree in co-relation 6322. Up to 1302 conditions per place. [2023-11-26 12:05:37,656 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 44 selfloop transitions, 8 changer transitions 45/112 dead transitions. [2023-11-26 12:05:37,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 479 flow [2023-11-26 12:05:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:05:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:05:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 350 transitions. [2023-11-26 12:05:37,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2023-11-26 12:05:37,659 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 350 transitions. [2023-11-26 12:05:37,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 350 transitions. [2023-11-26 12:05:37,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:37,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 350 transitions. [2023-11-26 12:05:37,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:37,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:37,664 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:37,664 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 97 flow. Second operand 10 states and 350 transitions. [2023-11-26 12:05:37,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 479 flow [2023-11-26 12:05:37,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 443 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-26 12:05:37,685 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 156 flow [2023-11-26 12:05:37,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-11-26 12:05:37,686 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2023-11-26 12:05:37,686 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 156 flow [2023-11-26 12:05:37,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:37,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:37,687 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 12:05:37,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:05:37,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:37,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 698895696, now seen corresponding path program 1 times [2023-11-26 12:05:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:37,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156634920] [2023-11-26 12:05:37,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:37,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 12:05:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156634920] [2023-11-26 12:05:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156634920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:37,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:05:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307224875] [2023-11-26 12:05:37,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:37,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:05:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:37,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:05:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:05:37,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:05:37,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:37,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:37,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:05:37,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:38,669 INFO L124 PetriNetUnfolderBase]: 2510/4238 cut-off events. [2023-11-26 12:05:38,669 INFO L125 PetriNetUnfolderBase]: For 2773/2906 co-relation queries the response was YES. [2023-11-26 12:05:38,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10732 conditions, 4238 events. 2510/4238 cut-off events. For 2773/2906 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 28071 event pairs, 354 based on Foata normal form. 225/4318 useless extension candidates. Maximal degree in co-relation 10712. Up to 2218 conditions per place. [2023-11-26 12:05:38,714 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 46 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-11-26 12:05:38,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 352 flow [2023-11-26 12:05:38,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:05:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:05:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-26 12:05:38,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2023-11-26 12:05:38,716 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-26 12:05:38,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-26 12:05:38,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:38,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-26 12:05:38,717 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 12:05:38,718 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 12:05:38,718 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 12:05:38,718 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 156 flow. Second operand 4 states and 151 transitions. [2023-11-26 12:05:38,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 352 flow [2023-11-26 12:05:38,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 344 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-26 12:05:38,747 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 186 flow [2023-11-26 12:05:38,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-11-26 12:05:38,748 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2023-11-26 12:05:38,748 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 186 flow [2023-11-26 12:05:38,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:38,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:38,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:38,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:05:38,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:38,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 338885090, now seen corresponding path program 1 times [2023-11-26 12:05:38,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239302569] [2023-11-26 12:05:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:05:38,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:38,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239302569] [2023-11-26 12:05:38,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239302569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:38,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:38,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:05:38,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571946522] [2023-11-26 12:05:38,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:38,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:38,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:05:38,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 186 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 12:05:38,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:38,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:05:38,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:39,889 INFO L124 PetriNetUnfolderBase]: 2513/4716 cut-off events. [2023-11-26 12:05:39,890 INFO L125 PetriNetUnfolderBase]: For 2955/3087 co-relation queries the response was YES. [2023-11-26 12:05:39,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12379 conditions, 4716 events. 2513/4716 cut-off events. For 2955/3087 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 35512 event pairs, 1035 based on Foata normal form. 93/4451 useless extension candidates. Maximal degree in co-relation 12359. Up to 1837 conditions per place. [2023-11-26 12:05:39,943 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 42 selfloop transitions, 9 changer transitions 16/88 dead transitions. [2023-11-26 12:05:39,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 462 flow [2023-11-26 12:05:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:05:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:05:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2023-11-26 12:05:39,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2023-11-26 12:05:39,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 247 transitions. [2023-11-26 12:05:39,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 247 transitions. [2023-11-26 12:05:39,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:39,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 247 transitions. [2023-11-26 12:05:39,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:39,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:39,958 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:39,958 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 186 flow. Second operand 7 states and 247 transitions. [2023-11-26 12:05:39,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 462 flow [2023-11-26 12:05:39,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:05:39,970 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 250 flow [2023-11-26 12:05:39,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2023-11-26 12:05:39,971 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2023-11-26 12:05:39,971 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 250 flow [2023-11-26 12:05:39,971 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 12:05:39,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:39,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:39,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:05:39,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:39,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1637360120, now seen corresponding path program 1 times [2023-11-26 12:05:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908087132] [2023-11-26 12:05:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:40,209 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 12:05:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908087132] [2023-11-26 12:05:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908087132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:05:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453603202] [2023-11-26 12:05:40,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:40,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:05:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:40,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:05:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:05:40,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:05:40,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:40,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:40,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:05:40,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:41,141 INFO L124 PetriNetUnfolderBase]: 2701/4574 cut-off events. [2023-11-26 12:05:41,142 INFO L125 PetriNetUnfolderBase]: For 4344/4593 co-relation queries the response was YES. [2023-11-26 12:05:41,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13060 conditions, 4574 events. 2701/4574 cut-off events. For 4344/4593 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 29943 event pairs, 249 based on Foata normal form. 293/4759 useless extension candidates. Maximal degree in co-relation 13035. Up to 1528 conditions per place. [2023-11-26 12:05:41,178 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 53 selfloop transitions, 8 changer transitions 9/91 dead transitions. [2023-11-26 12:05:41,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 540 flow [2023-11-26 12:05:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:05:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:05:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2023-11-26 12:05:41,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074074074074074 [2023-11-26 12:05:41,180 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2023-11-26 12:05:41,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2023-11-26 12:05:41,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:41,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2023-11-26 12:05:41,182 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 12:05:41,183 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 12:05:41,184 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 12:05:41,184 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 250 flow. Second operand 5 states and 191 transitions. [2023-11-26 12:05:41,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 540 flow [2023-11-26 12:05:41,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 525 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-26 12:05:41,204 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 262 flow [2023-11-26 12:05:41,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2023-11-26 12:05:41,205 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2023-11-26 12:05:41,205 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 262 flow [2023-11-26 12:05:41,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:41,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:41,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:41,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:05:41,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:41,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash -570168876, now seen corresponding path program 1 times [2023-11-26 12:05:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450677702] [2023-11-26 12:05:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:41,560 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 12:05:41,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450677702] [2023-11-26 12:05:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450677702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:05:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608149239] [2023-11-26 12:05:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:41,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:41,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:05:41,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:41,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:41,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:05:41,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:42,185 INFO L124 PetriNetUnfolderBase]: 1788/3090 cut-off events. [2023-11-26 12:05:42,185 INFO L125 PetriNetUnfolderBase]: For 5445/5837 co-relation queries the response was YES. [2023-11-26 12:05:42,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9991 conditions, 3090 events. 1788/3090 cut-off events. For 5445/5837 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 19967 event pairs, 188 based on Foata normal form. 172/3182 useless extension candidates. Maximal degree in co-relation 9964. Up to 1308 conditions per place. [2023-11-26 12:05:42,208 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 48 selfloop transitions, 11 changer transitions 2/80 dead transitions. [2023-11-26 12:05:42,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 80 transitions, 475 flow [2023-11-26 12:05:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:05:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:05:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2023-11-26 12:05:42,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2023-11-26 12:05:42,210 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 215 transitions. [2023-11-26 12:05:42,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 215 transitions. [2023-11-26 12:05:42,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:42,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 215 transitions. [2023-11-26 12:05:42,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:42,213 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 12:05:42,213 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 12:05:42,213 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 262 flow. Second operand 6 states and 215 transitions. [2023-11-26 12:05:42,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 80 transitions, 475 flow [2023-11-26 12:05:42,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 441 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-26 12:05:42,220 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 263 flow [2023-11-26 12:05:42,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-11-26 12:05:42,221 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2023-11-26 12:05:42,221 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 263 flow [2023-11-26 12:05:42,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:42,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:42,222 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 12:05:42,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:05:42,222 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:42,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1380081617, now seen corresponding path program 1 times [2023-11-26 12:05:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704622189] [2023-11-26 12:05:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:42,519 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 12:05:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:42,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704622189] [2023-11-26 12:05:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704622189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:42,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:42,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:05:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949746487] [2023-11-26 12:05:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:42,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:05:42,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:05:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:05:42,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:05:42,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:42,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:42,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:05:42,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:43,126 INFO L124 PetriNetUnfolderBase]: 1342/2898 cut-off events. [2023-11-26 12:05:43,126 INFO L125 PetriNetUnfolderBase]: For 5021/5339 co-relation queries the response was YES. [2023-11-26 12:05:43,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8601 conditions, 2898 events. 1342/2898 cut-off events. For 5021/5339 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 22920 event pairs, 382 based on Foata normal form. 39/2645 useless extension candidates. Maximal degree in co-relation 8576. Up to 956 conditions per place. [2023-11-26 12:05:43,152 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 23 selfloop transitions, 1 changer transitions 28/79 dead transitions. [2023-11-26 12:05:43,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 464 flow [2023-11-26 12:05:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:05:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:05:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-26 12:05:43,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2023-11-26 12:05:43,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-26 12:05:43,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-26 12:05:43,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:43,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-26 12:05:43,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:43,156 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 12:05:43,156 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 12:05:43,157 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 263 flow. Second operand 6 states and 206 transitions. [2023-11-26 12:05:43,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 464 flow [2023-11-26 12:05:43,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 416 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-26 12:05:43,190 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 223 flow [2023-11-26 12:05:43,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-11-26 12:05:43,191 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2023-11-26 12:05:43,191 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 223 flow [2023-11-26 12:05:43,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:43,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:43,192 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 12:05:43,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:05:43,193 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:43,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1459666641, now seen corresponding path program 2 times [2023-11-26 12:05:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:43,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758417848] [2023-11-26 12:05:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:45,637 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 12:05:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:05:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758417848] [2023-11-26 12:05:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758417848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:45,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:05:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976684297] [2023-11-26 12:05:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:45,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:05:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:05:45,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:05:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:05:45,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:45,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 223 flow. Second operand has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:45,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:45,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:45,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:46,460 INFO L124 PetriNetUnfolderBase]: 757/1715 cut-off events. [2023-11-26 12:05:46,460 INFO L125 PetriNetUnfolderBase]: For 1466/1600 co-relation queries the response was YES. [2023-11-26 12:05:46,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4501 conditions, 1715 events. 757/1715 cut-off events. For 1466/1600 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12885 event pairs, 146 based on Foata normal form. 27/1568 useless extension candidates. Maximal degree in co-relation 4476. Up to 319 conditions per place. [2023-11-26 12:05:46,474 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 22 selfloop transitions, 5 changer transitions 25/80 dead transitions. [2023-11-26 12:05:46,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 415 flow [2023-11-26 12:05:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:05:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:05:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 332 transitions. [2023-11-26 12:05:46,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2023-11-26 12:05:46,477 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 332 transitions. [2023-11-26 12:05:46,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 332 transitions. [2023-11-26 12:05:46,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:46,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 332 transitions. [2023-11-26 12:05:46,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 33.2) internal successors, (332), 10 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:46,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:46,482 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:46,482 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 223 flow. Second operand 10 states and 332 transitions. [2023-11-26 12:05:46,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 415 flow [2023-11-26 12:05:46,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 394 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-26 12:05:46,494 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 224 flow [2023-11-26 12:05:46,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2023-11-26 12:05:46,495 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2023-11-26 12:05:46,495 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 224 flow [2023-11-26 12:05:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 9 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:05:46,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:46,496 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 12:05:46,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:05:46,497 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:46,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1653137663, now seen corresponding path program 3 times [2023-11-26 12:05:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:05:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544259800] [2023-11-26 12:05:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:05:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:05:46,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:05:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:05:46,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:05:46,669 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:05:46,671 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 12:05:46,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 12:05:46,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 12:05:46,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 12:05:46,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 12:05:46,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 12:05:46,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 12:05:46,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 12:05:46,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 12:05:46,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 12:05:46,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 12:05:46,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 12:05:46,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 12:05:46,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 12:05:46,676 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:46,684 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:05:46,684 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:05:46,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:05:46,775 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 12:05:46,776 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 12:05:46,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:05:46,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:05:46,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:05:46 BasicIcfg [2023-11-26 12:05:46,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:05:46,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:05:46,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:05:46,818 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:05:46,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:30" (3/4) ... [2023-11-26 12:05:46,821 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:05:46,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:05:46,823 INFO L158 Benchmark]: Toolchain (without parser) took 18020.09ms. Allocated memory was 146.8MB in the beginning and 622.9MB in the end (delta: 476.1MB). Free memory was 103.8MB in the beginning and 222.8MB in the end (delta: -119.1MB). Peak memory consumption was 359.8MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,823 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:05:46,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 884.69ms. Allocated memory is still 146.8MB. Free memory was 103.5MB in the beginning and 79.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.63ms. Allocated memory is still 146.8MB. Free memory was 79.2MB in the beginning and 119.2MB in the end (delta: -40.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,825 INFO L158 Benchmark]: Boogie Preprocessor took 109.27ms. Allocated memory is still 146.8MB. Free memory was 119.2MB in the beginning and 115.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,825 INFO L158 Benchmark]: RCFGBuilder took 890.40ms. Allocated memory is still 146.8MB. Free memory was 115.2MB in the beginning and 64.9MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,826 INFO L158 Benchmark]: TraceAbstraction took 16001.85ms. Allocated memory was 146.8MB in the beginning and 622.9MB in the end (delta: 476.1MB). Free memory was 63.6MB in the beginning and 223.9MB in the end (delta: -160.2MB). Peak memory consumption was 316.7MB. Max. memory is 16.1GB. [2023-11-26 12:05:46,826 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 622.9MB. Free memory is still 222.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:05:46,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 884.69ms. Allocated memory is still 146.8MB. Free memory was 103.5MB in the beginning and 79.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.63ms. Allocated memory is still 146.8MB. Free memory was 79.2MB in the beginning and 119.2MB in the end (delta: -40.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.27ms. Allocated memory is still 146.8MB. Free memory was 119.2MB in the beginning and 115.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 890.40ms. Allocated memory is still 146.8MB. Free memory was 115.2MB in the beginning and 64.9MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16001.85ms. Allocated memory was 146.8MB in the beginning and 622.9MB in the end (delta: 476.1MB). Free memory was 63.6MB in the beginning and 223.9MB in the end (delta: -160.2MB). Peak memory consumption was 316.7MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 622.9MB. Free memory is still 222.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix019.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 842]: 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: 15.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 739 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 622 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1847 IncrementalHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 42 mSDtfsCounter, 1847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=14, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 12:05:46,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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_2821f46c-3877-4b17-b9b0-6698d72d5190/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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:05:49,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:05:49,689 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 12:05:49,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:05:49,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:05:49,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:05:49,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:05:49,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:05:49,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:05:49,750 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:05:49,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:05:49,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:05:49,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:05:49,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:05:49,757 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:05:49,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:05:49,758 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:05:49,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:05:49,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:05:49,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:05:49,760 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:05:49,761 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:05:49,761 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:05:49,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:05:49,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:05:49,762 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:05:49,763 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:05:49,763 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:05:49,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:05:49,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:05:49,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:05:49,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:05:49,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:05:49,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:05:49,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:49,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:05:49,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:05:49,769 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:05:49,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:05:49,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:05:49,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:05:49,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:05:49,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:05:49,770 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:05:49,771 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_2821f46c-3877-4b17-b9b0-6698d72d5190/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_2821f46c-3877-4b17-b9b0-6698d72d5190/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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2023-11-26 12:05:50,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:05:50,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:05:50,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:05:50,201 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:05:50,202 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:05:50,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2023-11-26 12:05:53,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:05:53,777 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:05:53,777 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2023-11-26 12:05:53,807 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data/18efca1c4/826a83bff15545f6a541bf8a750ccbb9/FLAG95156bb59 [2023-11-26 12:05:53,827 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/data/18efca1c4/826a83bff15545f6a541bf8a750ccbb9 [2023-11-26 12:05:53,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:05:53,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:05:53,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:53,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:05:53,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:05:53,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:53" (1/1) ... [2023-11-26 12:05:53,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19286c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:53, skipping insertion in model container [2023-11-26 12:05:53,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:53" (1/1) ... [2023-11-26 12:05:53,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:05:54,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:54,442 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:05:54,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:05:54,614 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:54,615 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:05:54,624 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:05:54,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54 WrapperNode [2023-11-26 12:05:54,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:05:54,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:54,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:05:54,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:05:54,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,753 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-11-26 12:05:54,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:05:54,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:05:54,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:05:54,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:05:54,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,820 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 12:05:54,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:05:54,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:05:54,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:05:54,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:05:54,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (1/1) ... [2023-11-26 12:05:54,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:05:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:05:54,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:05:54,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:05:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:05:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:05:55,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:05:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:05:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 12:05:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 12:05:55,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 12:05:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 12:05:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 12:05:55,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 12:05:55,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 12:05:55,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 12:05:55,010 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:05:55,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:05:55,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:05:55,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:05:55,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:05:55,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:05:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:05:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:05:55,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:05:55,016 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 12:05:55,312 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:05:55,315 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:05:55,760 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:05:56,049 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:05:56,049 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:05:56,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:56 BoogieIcfgContainer [2023-11-26 12:05:56,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:05:56,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:05:56,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:05:56,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:05:56,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:53" (1/3) ... [2023-11-26 12:05:56,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3c6b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:56, skipping insertion in model container [2023-11-26 12:05:56,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:54" (2/3) ... [2023-11-26 12:05:56,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3c6b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:56, skipping insertion in model container [2023-11-26 12:05:56,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:56" (3/3) ... [2023-11-26 12:05:56,060 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2023-11-26 12:05:56,088 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:05:56,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 12:05:56,089 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:05:56,174 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:05:56,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 12:05:56,284 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-26 12:05:56,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:05:56,293 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 5. Compared 97 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 12:05:56,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 12:05:56,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-26 12:05:56,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:05:56,316 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;@714da6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:05:56,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 12:05:56,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:05:56,320 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:05:56,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:05:56,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:56,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:05:56,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:56,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash 13083, now seen corresponding path program 1 times [2023-11-26 12:05:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:05:56,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161692383] [2023-11-26 12:05:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:56,348 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 12:05:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:05:56,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:56,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:56,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:05:56,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:56,572 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 12:05:56,585 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 12:05:56,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:56,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:05:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161692383] [2023-11-26 12:05:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161692383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:56,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:56,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:05:56,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158610884] [2023-11-26 12:05:56,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:56,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:05:56,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:56,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:56,689 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 12:05:56,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:56,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:56,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:57,157 INFO L124 PetriNetUnfolderBase]: 557/1141 cut-off events. [2023-11-26 12:05:57,157 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 12:05:57,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1141 events. 557/1141 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8355 event pairs, 413 based on Foata normal form. 72/1136 useless extension candidates. Maximal degree in co-relation 2013. Up to 647 conditions per place. [2023-11-26 12:05:57,178 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 12:05:57,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 179 flow [2023-11-26 12:05:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:57,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:57,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:57,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:57,200 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 12:05:57,204 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 12:05:57,204 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 12:05:57,206 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:57,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 179 flow [2023-11-26 12:05:57,210 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 12:05:57,213 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 12:05:57,215 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 12:05:57,219 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 12:05:57,219 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 12:05:57,220 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 12:05:57,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:57,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:05:57,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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)] Forceful destruction successful, exit code 0 [2023-11-26 12:05:57,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:57,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:57,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 13084, now seen corresponding path program 1 times [2023-11-26 12:05:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:05:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104619081] [2023-11-26 12:05:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:57,426 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 12:05:57,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:05:57,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:57,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:57,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:05:57,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:57,578 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 12:05:57,592 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 12:05:57,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:57,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:05:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104619081] [2023-11-26 12:05:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104619081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:57,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:05:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225673215] [2023-11-26 12:05:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:57,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:05:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:57,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:05:57,647 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 12:05:57,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:57,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:05:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:57,968 INFO L124 PetriNetUnfolderBase]: 557/1140 cut-off events. [2023-11-26 12:05:57,968 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 12:05:57,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1140 events. 557/1140 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8392 event pairs, 413 based on Foata normal form. 1/1064 useless extension candidates. Maximal degree in co-relation 2049. Up to 646 conditions per place. [2023-11-26 12:05:57,982 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 12:05:57,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-26 12:05:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:57,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:57,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:57,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:57,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:57,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:57,988 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 12:05:57,989 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 12:05:57,990 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 12:05:57,990 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-26 12:05:57,993 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 12:05:57,995 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 12:05:57,995 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 12:05:57,996 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 12:05:57,997 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 12:05:57,997 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 12:05:58,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:58,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:05:58,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:58,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 390153472, now seen corresponding path program 1 times [2023-11-26 12:05:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:05:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521438043] [2023-11-26 12:05:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:58,206 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 12:05:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:05:58,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:58,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:05:58,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:58,343 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 12:05:58,349 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 12:05:58,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:58,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:05:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521438043] [2023-11-26 12:05:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521438043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207398059] [2023-11-26 12:05:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:58,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:58,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:05:58,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:58,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:58,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:58,389 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 12:05:58,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:58,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:58,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:58,677 INFO L124 PetriNetUnfolderBase]: 558/1139 cut-off events. [2023-11-26 12:05:58,677 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 12:05:58,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1139 events. 558/1139 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8292 event pairs, 334 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 2051. Up to 646 conditions per place. [2023-11-26 12:05:58,691 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 12:05:58,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-26 12:05:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-26 12:05:58,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-26 12:05:58,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-26 12:05:58,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-26 12:05:58,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:58,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-26 12:05:58,696 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 12:05:58,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 12:05:58,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 12:05:58,698 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 115 transitions. [2023-11-26 12:05:58,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-26 12:05:58,700 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 12:05:58,703 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 12:05:58,703 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 12:05:58,705 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-26 12:05:58,706 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 12:05:58,706 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 12:05:58,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:58,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:05:58,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:58,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 390153473, now seen corresponding path program 1 times [2023-11-26 12:05:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:05:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730304686] [2023-11-26 12:05:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:58,911 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 12:05:58,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:05:58,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:58,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:59,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:05:59,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:59,033 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 12:05:59,046 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 12:05:59,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:59,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:05:59,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730304686] [2023-11-26 12:05:59,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730304686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:59,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094224823] [2023-11-26 12:05:59,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:59,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:05:59,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:59,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:59,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:05:59,082 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 12:05:59,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:59,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:05:59,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:05:59,371 INFO L124 PetriNetUnfolderBase]: 557/1135 cut-off events. [2023-11-26 12:05:59,372 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 12:05:59,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 1135 events. 557/1135 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8341 event pairs, 412 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 2046. Up to 643 conditions per place. [2023-11-26 12:05:59,382 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-26 12:05:59,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-26 12:05:59,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:05:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:05:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:05:59,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:05:59,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:05:59,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:05:59,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:05:59,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:05:59,386 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 12:05:59,387 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 12:05:59,387 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 12:05:59,388 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:05:59,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-26 12:05:59,390 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 12:05:59,391 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 12:05:59,392 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 12:05:59,393 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-26 12:05:59,393 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 12:05:59,393 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 12:05:59,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:05:59,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:05:59,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:59,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:59,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:05:59,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:05:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 880976927, now seen corresponding path program 1 times [2023-11-26 12:05:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:05:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910271610] [2023-11-26 12:05:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:05:59,598 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 12:05:59,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:05:59,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:59,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:05:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:05:59,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:05:59,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:05:59,730 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 12:05:59,738 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 12:05:59,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:05:59,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:05:59,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910271610] [2023-11-26 12:05:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910271610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:05:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:05:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:05:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070520120] [2023-11-26 12:05:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:05:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:05:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:05:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:05:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:05:59,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 12:05:59,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 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 12:05:59,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:05:59,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 12:05:59,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:00,069 INFO L124 PetriNetUnfolderBase]: 564/1137 cut-off events. [2023-11-26 12:06:00,069 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 12:06:00,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 1137 events. 564/1137 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8319 event pairs, 238 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 2061. Up to 644 conditions per place. [2023-11-26 12:06:00,080 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-26 12:06:00,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-26 12:06:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:06:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:06:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-26 12:06:00,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-26 12:06:00,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-26 12:06:00,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-26 12:06:00,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:00,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-26 12:06:00,086 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 12:06:00,087 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 12:06:00,088 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 12:06:00,088 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 115 transitions. [2023-11-26 12:06:00,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-26 12:06:00,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:06:00,091 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-26 12:06:00,091 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=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 12:06:00,097 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 12:06:00,097 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-26 12:06:00,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 12:06:00,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:00,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:00,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:00,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 880976928, now seen corresponding path program 1 times [2023-11-26 12:06:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353938373] [2023-11-26 12:06:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:00,303 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 12:06:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:00,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:00,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:06:00,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:00,420 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 12:06:00,430 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 12:06:00,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:00,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353938373] [2023-11-26 12:06:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353938373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:00,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:06:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524757022] [2023-11-26 12:06:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:06:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:00,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:06:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:06:00,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:06:00,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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 12:06:00,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:00,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:06:00,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:00,723 INFO L124 PetriNetUnfolderBase]: 557/1124 cut-off events. [2023-11-26 12:06:00,723 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-26 12:06:00,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1124 events. 557/1124 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8043 event pairs, 238 based on Foata normal form. 6/1074 useless extension candidates. Maximal degree in co-relation 2039. Up to 631 conditions per place. [2023-11-26 12:06:00,733 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-26 12:06:00,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 168 flow [2023-11-26 12:06:00,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:06:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:06:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 12:06:00,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:06:00,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 12:06:00,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 12:06:00,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:00,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 12:06:00,737 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 12:06:00,738 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 12:06:00,738 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 12:06:00,738 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 117 transitions. [2023-11-26 12:06:00,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 168 flow [2023-11-26 12:06:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:06:00,741 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-26 12:06:00,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-26 12:06:00,742 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-26 12:06:00,743 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-26 12:06:00,743 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 12:06:00,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:00,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:00,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:00,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1361112843, now seen corresponding path program 1 times [2023-11-26 12:06:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:00,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22519900] [2023-11-26 12:06:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:00,955 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 12:06:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:00,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:00,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:01,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:06:01,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:01,103 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 12:06:01,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:01,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:01,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22519900] [2023-11-26 12:06:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22519900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:06:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552225718] [2023-11-26 12:06:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:01,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:06:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:01,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:06:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:06:01,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-26 12:06:01,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:01,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:01,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-26 12:06:01,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:01,302 INFO L124 PetriNetUnfolderBase]: 459/876 cut-off events. [2023-11-26 12:06:01,303 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 12:06:01,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 876 events. 459/876 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5805 event pairs, 67 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1639. Up to 585 conditions per place. [2023-11-26 12:06:01,311 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-11-26 12:06:01,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 174 flow [2023-11-26 12:06:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:06:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:06:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:06:01,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2023-11-26 12:06:01,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:06:01,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:06:01,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:01,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:06:01,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:01,315 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 12:06:01,315 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 12:06:01,316 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:06:01,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 174 flow [2023-11-26 12:06:01,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:06:01,318 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2023-11-26 12:06:01,318 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=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-26 12:06:01,319 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-26 12:06:01,320 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2023-11-26 12:06:01,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:01,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:01,320 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 12:06:01,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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)] Ended with exit code 0 [2023-11-26 12:06:01,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:01,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:01,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1096881211, now seen corresponding path program 1 times [2023-11-26 12:06:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263960687] [2023-11-26 12:06:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:01,525 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 12:06:01,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:01,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:01,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:01,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:06:01,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:01,708 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 12:06:01,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:01,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263960687] [2023-11-26 12:06:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263960687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:01,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:06:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105323491] [2023-11-26 12:06:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:06:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:06:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:06:01,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:06:01,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 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 12:06:01,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:01,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:06:01,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:02,147 INFO L124 PetriNetUnfolderBase]: 1217/2187 cut-off events. [2023-11-26 12:06:02,148 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-26 12:06:02,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4167 conditions, 2187 events. 1217/2187 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14445 event pairs, 107 based on Foata normal form. 72/2254 useless extension candidates. Maximal degree in co-relation 4156. Up to 1213 conditions per place. [2023-11-26 12:06:02,165 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2023-11-26 12:06:02,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 236 flow [2023-11-26 12:06:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:06:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:06:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2023-11-26 12:06:02,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 12:06:02,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 152 transitions. [2023-11-26 12:06:02,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 152 transitions. [2023-11-26 12:06:02,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:02,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 152 transitions. [2023-11-26 12:06:02,169 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 12:06:02,169 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 12:06:02,170 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 12:06:02,170 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 4 states and 152 transitions. [2023-11-26 12:06:02,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 236 flow [2023-11-26 12:06:02,171 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 12:06:02,173 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2023-11-26 12:06:02,173 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 12:06:02,174 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 12:06:02,174 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2023-11-26 12:06:02,174 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 12:06:02,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:02,175 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 12:06:02,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:02,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:02,381 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:02,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1953478000, now seen corresponding path program 1 times [2023-11-26 12:06:02,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:02,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352902212] [2023-11-26 12:06:02,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:02,382 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 12:06:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:02,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:02,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:02,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:06:02,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:02,598 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 12:06:02,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:02,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:02,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352902212] [2023-11-26 12:06:02,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352902212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:02,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:02,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:06:02,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519935933] [2023-11-26 12:06:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:02,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:06:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:02,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:06:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:06:02,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:06:02,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:02,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:02,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:06:02,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:02,956 INFO L124 PetriNetUnfolderBase]: 801/1453 cut-off events. [2023-11-26 12:06:02,957 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-11-26 12:06:02,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 1453 events. 801/1453 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8342 event pairs, 41 based on Foata normal form. 64/1512 useless extension candidates. Maximal degree in co-relation 3206. Up to 625 conditions per place. [2023-11-26 12:06:02,968 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 50 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2023-11-26 12:06:02,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 325 flow [2023-11-26 12:06:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:06:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:06:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2023-11-26 12:06:02,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074074074074074 [2023-11-26 12:06:02,970 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2023-11-26 12:06:02,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2023-11-26 12:06:02,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:02,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2023-11-26 12:06:02,972 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 12:06:02,972 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 12:06:02,973 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 12:06:02,973 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 191 transitions. [2023-11-26 12:06:02,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 325 flow [2023-11-26 12:06:02,977 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 12:06:02,979 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2023-11-26 12:06:02,980 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 12:06:02,980 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 12:06:02,981 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2023-11-26 12:06:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:02,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:02,981 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 12:06:02,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -899581749, now seen corresponding path program 1 times [2023-11-26 12:06:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042338020] [2023-11-26 12:06:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:03,187 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 12:06:03,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:03,188 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:03,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:06:03,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:03,409 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 12:06:03,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:03,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042338020] [2023-11-26 12:06:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042338020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:06:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982334636] [2023-11-26 12:06:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:06:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:06:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:06:03,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 12:06:03,422 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.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:03,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:03,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 12:06:03,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:03,759 INFO L124 PetriNetUnfolderBase]: 423/739 cut-off events. [2023-11-26 12:06:03,760 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-11-26 12:06:03,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 739 events. 423/739 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3294 event pairs, 29 based on Foata normal form. 36/770 useless extension candidates. Maximal degree in co-relation 1914. Up to 268 conditions per place. [2023-11-26 12:06:03,767 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 44 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2023-11-26 12:06:03,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 336 flow [2023-11-26 12:06:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:06:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:06:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2023-11-26 12:06:03,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2023-11-26 12:06:03,770 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 214 transitions. [2023-11-26 12:06:03,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 214 transitions. [2023-11-26 12:06:03,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:03,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 214 transitions. [2023-11-26 12:06:03,772 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 12:06:03,773 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 12:06:03,773 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 12:06:03,774 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 160 flow. Second operand 6 states and 214 transitions. [2023-11-26 12:06:03,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 336 flow [2023-11-26 12:06:03,777 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 12:06:03,779 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 174 flow [2023-11-26 12:06:03,779 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 12:06:03,780 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2023-11-26 12:06:03,780 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 174 flow [2023-11-26 12:06:03,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:03,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:03,781 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 12:06:03,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,984 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:03,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -937727447, now seen corresponding path program 1 times [2023-11-26 12:06:03,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:03,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036759888] [2023-11-26 12:06:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:03,986 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 12:06:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:03,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:03,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:04,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 12:06:04,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:04,879 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t501~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t500~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t502~0#1.base_43| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t500~0#1.base_41| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t500~0#1.base_41|)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t500~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t501~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t502~0#1.base_43| (_ bv0 1)) |c_#valid|) (= (select .cse0 |v_ULTIMATE.start_main_~#t501~0#1.base_41|) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t501~0#1.base_41| (_ bv1 1)) |v_ULTIMATE.start_main_~#t502~0#1.base_43|))))) is different from true [2023-11-26 12:06:04,880 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 12:06:04,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:04,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036759888] [2023-11-26 12:06:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036759888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:06:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346140979] [2023-11-26 12:06:04,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:04,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:06:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:06:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-26 12:06:04,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2023-11-26 12:06:04,884 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 12:06:04,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:04,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2023-11-26 12:06:04,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:05,225 INFO L124 PetriNetUnfolderBase]: 225/484 cut-off events. [2023-11-26 12:06:05,225 INFO L125 PetriNetUnfolderBase]: For 204/216 co-relation queries the response was YES. [2023-11-26 12:06:05,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 484 events. 225/484 cut-off events. For 204/216 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2313 event pairs, 179 based on Foata normal form. 8/468 useless extension candidates. Maximal degree in co-relation 1062. Up to 307 conditions per place. [2023-11-26 12:06:05,230 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 26 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-11-26 12:06:05,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 260 flow [2023-11-26 12:06:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:06:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:06:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2023-11-26 12:06:05,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2023-11-26 12:06:05,233 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 154 transitions. [2023-11-26 12:06:05,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 154 transitions. [2023-11-26 12:06:05,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:05,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 154 transitions. [2023-11-26 12:06:05,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:05,235 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 12:06:05,236 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 12:06:05,236 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 174 flow. Second operand 6 states and 154 transitions. [2023-11-26 12:06:05,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 260 flow [2023-11-26 12:06:05,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 204 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-26 12:06:05,239 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 150 flow [2023-11-26 12:06:05,240 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 12:06:05,240 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-26 12:06:05,241 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 150 flow [2023-11-26 12:06:05,241 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 12:06:05,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:05,241 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 12:06:05,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:05,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:05,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:05,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1517192755, now seen corresponding path program 1 times [2023-11-26 12:06:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:05,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328047841] [2023-11-26 12:06:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:06:05,447 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 12:06:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:05,449 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:05,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:06:05,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:06:05,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:05,680 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 12:06:05,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:05,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328047841] [2023-11-26 12:06:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328047841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:06:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783761499] [2023-11-26 12:06:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:05,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:06:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:06:05,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:06:05,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 12:06:05,700 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 12:06:05,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:05,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 12:06:05,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:06,071 INFO L124 PetriNetUnfolderBase]: 620/1248 cut-off events. [2023-11-26 12:06:06,071 INFO L125 PetriNetUnfolderBase]: For 376/420 co-relation queries the response was YES. [2023-11-26 12:06:06,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 1248 events. 620/1248 cut-off events. For 376/420 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6910 event pairs, 252 based on Foata normal form. 8/1200 useless extension candidates. Maximal degree in co-relation 2873. Up to 488 conditions per place. [2023-11-26 12:06:06,084 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 47 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2023-11-26 12:06:06,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 346 flow [2023-11-26 12:06:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:06:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:06:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-26 12:06:06,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2023-11-26 12:06:06,086 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-26 12:06:06,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-26 12:06:06,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:06,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-26 12:06:06,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:06,089 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 12:06:06,089 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 12:06:06,089 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 150 flow. Second operand 5 states and 182 transitions. [2023-11-26 12:06:06,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 346 flow [2023-11-26 12:06:06,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 12:06:06,093 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 178 flow [2023-11-26 12:06:06,093 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 12:06:06,094 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2023-11-26 12:06:06,094 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 178 flow [2023-11-26 12:06:06,094 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 12:06:06,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:06,095 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 12:06:06,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:06,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:06,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:06,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 757800131, now seen corresponding path program 2 times [2023-11-26 12:06:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988667573] [2023-11-26 12:06:06,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 12:06:06,300 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 12:06:06,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:06,302 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:06,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:06,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 12:06:06,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:06:06,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 12:06:06,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:06,562 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 12:06:06,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:06,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988667573] [2023-11-26 12:06:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988667573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:06:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728929568] [2023-11-26 12:06:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:06,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:06:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:06:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:06:06,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 12:06:06,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:06,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:06,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 12:06:06,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:07,082 INFO L124 PetriNetUnfolderBase]: 910/1878 cut-off events. [2023-11-26 12:06:07,082 INFO L125 PetriNetUnfolderBase]: For 722/790 co-relation queries the response was YES. [2023-11-26 12:06:07,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 1878 events. 910/1878 cut-off events. For 722/790 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11759 event pairs, 252 based on Foata normal form. 8/1801 useless extension candidates. Maximal degree in co-relation 4520. Up to 785 conditions per place. [2023-11-26 12:06:07,100 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 55 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2023-11-26 12:06:07,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 428 flow [2023-11-26 12:06:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:06:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:06:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2023-11-26 12:06:07,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2023-11-26 12:06:07,103 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 214 transitions. [2023-11-26 12:06:07,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 214 transitions. [2023-11-26 12:06:07,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:07,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 214 transitions. [2023-11-26 12:06:07,104 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 12:06:07,105 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 12:06:07,106 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 12:06:07,106 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 178 flow. Second operand 6 states and 214 transitions. [2023-11-26 12:06:07,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 428 flow [2023-11-26 12:06:07,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:06:07,115 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 259 flow [2023-11-26 12:06:07,115 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-11-26 12:06:07,116 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2023-11-26 12:06:07,117 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 259 flow [2023-11-26 12:06:07,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:07,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:07,117 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 12:06:07,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:07,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:07,321 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:07,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash -199309969, now seen corresponding path program 3 times [2023-11-26 12:06:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:07,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509478509] [2023-11-26 12:06:07,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 12:06:07,322 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 12:06:07,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:07,323 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:07,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:07,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-26 12:06:07,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:06:07,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-26 12:06:07,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:06:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:06:08,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:06:08,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:06:08,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509478509] [2023-11-26 12:06:08,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509478509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:06:08,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:06:08,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:06:08,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531831842] [2023-11-26 12:06:08,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:06:08,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:06:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:06:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:06:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:06:08,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 12:06:08,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 259 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 12:06:08,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:06:08,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 12:06:08,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:06:09,229 INFO L124 PetriNetUnfolderBase]: 1190/2425 cut-off events. [2023-11-26 12:06:09,229 INFO L125 PetriNetUnfolderBase]: For 1743/1749 co-relation queries the response was YES. [2023-11-26 12:06:09,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6496 conditions, 2425 events. 1190/2425 cut-off events. For 1743/1749 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16144 event pairs, 216 based on Foata normal form. 8/2332 useless extension candidates. Maximal degree in co-relation 6477. Up to 1169 conditions per place. [2023-11-26 12:06:09,255 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 54 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2023-11-26 12:06:09,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 595 flow [2023-11-26 12:06:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:06:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:06:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 309 transitions. [2023-11-26 12:06:09,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2023-11-26 12:06:09,258 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 309 transitions. [2023-11-26 12:06:09,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 309 transitions. [2023-11-26 12:06:09,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:06:09,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 309 transitions. [2023-11-26 12:06:09,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.333333333333336) internal successors, (309), 9 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:06:09,263 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 12:06:09,263 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 12:06:09,263 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 259 flow. Second operand 9 states and 309 transitions. [2023-11-26 12:06:09,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 595 flow [2023-11-26 12:06:09,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:06:09,279 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 453 flow [2023-11-26 12:06:09,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=453, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2023-11-26 12:06:09,281 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-11-26 12:06:09,281 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 453 flow [2023-11-26 12:06:09,281 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 12:06:09,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:06:09,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:09,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:09,485 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:06:09,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:06:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1687113847, now seen corresponding path program 4 times [2023-11-26 12:06:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:06:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957248010] [2023-11-26 12:06:09,486 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 12:06:09,486 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 12:06:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:06:09,487 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:09,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:09,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 12:06:09,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 12:06:09,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:06:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:06:09,931 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 12:06:09,932 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:06:09,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 12:06:09,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 12:06:09,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 12:06:09,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 12:06:09,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 12:06:09,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 12:06:09,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 12:06:09,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 12:06:09,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 12:06:09,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 12:06:09,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 12:06:09,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 12:06:09,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 12:06:09,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:10,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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 12:06:10,143 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:06:10,151 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:06:10,151 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:06:10,246 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:06:10,251 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 12:06:10,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 12:06:10,274 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:06:10,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:06:10,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:06:10 BasicIcfg [2023-11-26 12:06:10,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:06:10,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:06:10,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:06:10,302 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:06:10,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:56" (3/4) ... [2023-11-26 12:06:10,304 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:06:10,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:06:10,306 INFO L158 Benchmark]: Toolchain (without parser) took 16471.96ms. Allocated memory was 69.2MB in the beginning and 174.1MB in the end (delta: 104.9MB). Free memory was 43.7MB in the beginning and 139.7MB in the end (delta: -96.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2023-11-26 12:06:10,306 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:06:10,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 788.76ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 55.5MB in the end (delta: -12.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-11-26 12:06:10,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.58ms. Allocated memory is still 90.2MB. Free memory was 55.1MB in the beginning and 52.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:06:10,307 INFO L158 Benchmark]: Boogie Preprocessor took 141.72ms. Allocated memory is still 90.2MB. Free memory was 52.6MB in the beginning and 48.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:06:10,308 INFO L158 Benchmark]: RCFGBuilder took 1151.28ms. Allocated memory is still 90.2MB. Free memory was 48.8MB in the beginning and 39.0MB in the end (delta: 9.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-26 12:06:10,308 INFO L158 Benchmark]: TraceAbstraction took 14248.61ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 38.4MB in the beginning and 140.7MB in the end (delta: -102.3MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2023-11-26 12:06:10,308 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 139.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:06:10,311 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.33ms. Allocated memory is still 69.2MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 788.76ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 55.5MB in the end (delta: -12.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.58ms. Allocated memory is still 90.2MB. Free memory was 55.1MB in the beginning and 52.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.72ms. Allocated memory is still 90.2MB. Free memory was 52.6MB in the beginning and 48.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1151.28ms. Allocated memory is still 90.2MB. Free memory was 48.8MB in the beginning and 39.0MB in the end (delta: 9.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14248.61ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 38.4MB in the beginning and 140.7MB in the end (delta: -102.3MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 139.7MB 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={7:0}, t501={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500={7:0}, t501={3:0}, t502={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={7:0}, t501={3:0}, t502={5:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={7:0}, t501={3:0}, t502={5:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={7:0}, t501={3:0}, t502={5:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix019.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 844]: 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: 846]: 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.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1309 IncrementalHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 36 mSDtfsCounter, 1309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=14, InterpolantAutomatonStates: 62, 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, 2.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 232 ConstructedInterpolants, 1 QuantifiedInterpolants, 1850 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1640 ConjunctsInSsa, 81 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 12:06:10,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2821f46c-3877-4b17-b9b0-6698d72d5190/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