./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 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_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx --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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:26:50,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:26:50,962 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:26:50,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:26:50,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:26:51,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:26:51,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:26:51,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:26:51,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:26:51,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:26:51,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:26:51,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:26:51,018 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:26:51,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:26:51,021 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:26:51,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:26:51,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:26:51,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:26:51,022 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:26:51,023 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:26:51,023 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:26:51,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:26:51,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:26:51,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:26:51,025 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:26:51,025 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:26:51,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:26:51,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:26:51,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:26:51,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:26:51,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:26:51,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:26:51,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:26:51,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:26:51,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:26:51,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:26:51,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:26:51,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:26:51,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:26:51,031 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_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/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_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx 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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2023-11-21 22:26:51,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:26:51,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:26:51,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:26:51,365 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:26:51,366 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:26:51,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-21 22:26:54,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:26:54,744 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:26:54,745 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-21 22:26:54,777 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data/daa012b67/dd1f9ab634a64df0aaab445553923a8d/FLAGc91591c59 [2023-11-21 22:26:54,790 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data/daa012b67/dd1f9ab634a64df0aaab445553923a8d [2023-11-21 22:26:54,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:26:54,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:26:54,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:26:54,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:26:54,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:26:54,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:26:54" (1/1) ... [2023-11-21 22:26:54,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a8caf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:54, skipping insertion in model container [2023-11-21 22:26:54,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:26:54" (1/1) ... [2023-11-21 22:26:54,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:26:55,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:26:55,394 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:26:55,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:26:55,551 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:26:55,551 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:26:55,559 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:26:55,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55 WrapperNode [2023-11-21 22:26:55,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:26:55,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:26:55,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:26:55,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:26:55,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,655 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-11-21 22:26:55,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:26:55,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:26:55,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:26:55,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:26:55,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:26:55,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:26:55,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:26:55,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:26:55,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (1/1) ... [2023-11-21 22:26:55,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:26:55,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:26:55,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:26:55,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:26:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:26:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:26:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:26:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:26:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:26:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:26:55,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:26:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:26:55,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:26:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:26:55,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:26:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:26:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:26:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:26:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:26:55,846 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:26:56,005 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:26:56,007 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:26:56,432 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:26:56,733 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:26:56,766 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:26:56,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:26:56 BoogieIcfgContainer [2023-11-21 22:26:56,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:26:56,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:26:56,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:26:56,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:26:56,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:26:54" (1/3) ... [2023-11-21 22:26:56,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2390c179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:26:56, skipping insertion in model container [2023-11-21 22:26:56,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:55" (2/3) ... [2023-11-21 22:26:56,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2390c179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:26:56, skipping insertion in model container [2023-11-21 22:26:56,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:26:56" (3/3) ... [2023-11-21 22:26:56,777 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-21 22:26:56,802 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:26:56,802 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 22:26:56,803 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:26:56,864 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:26:56,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-21 22:26:56,963 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-21 22:26:56,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:26:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-21 22:26:56,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-21 22:26:56,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-21 22:26:56,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:26:57,000 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;@7b08795e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:26:57,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-21 22:26:57,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:26:57,003 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:26:57,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:26:57,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:57,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:26:57,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:26:57,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 13238, now seen corresponding path program 1 times [2023-11-21 22:26:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253898395] [2023-11-21 22:26:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:57,300 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-21 22:26:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253898395] [2023-11-21 22:26:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253898395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:57,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359193249] [2023-11-21 22:26:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:57,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:57,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:57,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:26:57,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:57,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:57,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:26:57,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:57,946 INFO L124 PetriNetUnfolderBase]: 941/1842 cut-off events. [2023-11-21 22:26:57,946 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-21 22:26:57,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 1842 events. 941/1842 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12813 event pairs, 707 based on Foata normal form. 108/1810 useless extension candidates. Maximal degree in co-relation 3294. Up to 1075 conditions per place. [2023-11-21 22:26:57,974 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-21 22:26:57,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 183 flow [2023-11-21 22:26:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:26:57,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-21 22:26:57,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:26:57,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:26:57,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:57,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:26:57,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,010 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:26:58,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 183 flow [2023-11-21 22:26:58,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 22:26:58,024 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-21 22:26:58,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-21 22:26:58,032 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-21 22:26:58,033 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-21 22:26:58,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:58,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:26:58,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:26:58,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:26:58,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 13239, now seen corresponding path program 1 times [2023-11-21 22:26:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687534660] [2023-11-21 22:26:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:58,187 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-21 22:26:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687534660] [2023-11-21 22:26:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687534660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785355876] [2023-11-21 22:26:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:58,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:58,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:58,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-21 22:26:58,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:58,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-21 22:26:58,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:58,615 INFO L124 PetriNetUnfolderBase]: 941/1841 cut-off events. [2023-11-21 22:26:58,615 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-21 22:26:58,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1841 events. 941/1841 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12801 event pairs, 707 based on Foata normal form. 1/1702 useless extension candidates. Maximal degree in co-relation 3348. Up to 1074 conditions per place. [2023-11-21 22:26:58,634 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-21 22:26:58,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-21 22:26:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:26:58,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-21 22:26:58,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:26:58,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:26:58,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:58,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:26:58,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,647 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:26:58,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-21 22:26:58,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:58,654 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-21 22:26:58,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-21 22:26:58,656 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-21 22:26:58,656 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-21 22:26:58,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:58,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:26:58,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:26:58,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:26:58,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash 394774135, now seen corresponding path program 1 times [2023-11-21 22:26:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848460788] [2023-11-21 22:26:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:58,756 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-21 22:26:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848460788] [2023-11-21 22:26:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848460788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:26:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448163165] [2023-11-21 22:26:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:58,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:58,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:58,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:26:58,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:58,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:58,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:26:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:59,162 INFO L124 PetriNetUnfolderBase]: 943/1840 cut-off events. [2023-11-21 22:26:59,162 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-21 22:26:59,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1840 events. 943/1840 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12741 event pairs, 537 based on Foata normal form. 0/1706 useless extension candidates. Maximal degree in co-relation 3352. Up to 1075 conditions per place. [2023-11-21 22:26:59,182 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-21 22:26:59,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 180 flow [2023-11-21 22:26:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-21 22:26:59,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-21 22:26:59,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-21 22:26:59,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-21 22:26:59,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:59,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-21 22:26:59,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,193 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-21 22:26:59,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 180 flow [2023-11-21 22:26:59,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:59,199 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-21 22:26:59,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-21 22:26:59,202 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-21 22:26:59,202 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-21 22:26:59,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:59,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:26:59,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:26:59,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:26:59,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 394774136, now seen corresponding path program 1 times [2023-11-21 22:26:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415731780] [2023-11-21 22:26:59,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:59,326 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-21 22:26:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415731780] [2023-11-21 22:26:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415731780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:59,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:26:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320201718] [2023-11-21 22:26:59,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:59,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:59,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-21 22:26:59,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:59,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-21 22:26:59,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:59,766 INFO L124 PetriNetUnfolderBase]: 941/1821 cut-off events. [2023-11-21 22:26:59,766 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-21 22:26:59,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 1821 events. 941/1821 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12464 event pairs, 723 based on Foata normal form. 3/1687 useless extension candidates. Maximal degree in co-relation 3331. Up to 1070 conditions per place. [2023-11-21 22:26:59,784 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-21 22:26:59,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 176 flow [2023-11-21 22:26:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:26:59,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-21 22:26:59,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:26:59,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:26:59,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:59,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:26:59,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,792 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:26:59,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 176 flow [2023-11-21 22:26:59,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:59,797 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-21 22:26:59,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-21 22:26:59,800 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-21 22:26:59,800 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-21 22:26:59,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:59,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:59,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:59,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:26:59,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:26:59,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1096199068, now seen corresponding path program 1 times [2023-11-21 22:26:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:59,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422694745] [2023-11-21 22:26:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:00,039 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-21 22:27:00,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:00,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422694745] [2023-11-21 22:27:00,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422694745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:00,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:00,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:27:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642931889] [2023-11-21 22:27:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:00,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:00,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-21 22:27:00,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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-21 22:27:00,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:00,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-21 22:27:00,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:00,337 INFO L124 PetriNetUnfolderBase]: 772/1411 cut-off events. [2023-11-21 22:27:00,337 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-21 22:27:00,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1411 events. 772/1411 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8556 event pairs, 240 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 2659. Up to 989 conditions per place. [2023-11-21 22:27:00,350 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 30 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2023-11-21 22:27:00,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2023-11-21 22:27:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-21 22:27:00,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2023-11-21 22:27:00,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-21 22:27:00,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-21 22:27:00,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:00,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-21 22:27:00,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,363 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 119 transitions. [2023-11-21 22:27:00,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2023-11-21 22:27:00,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:00,366 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-21 22:27:00,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-21 22:27:00,369 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-21 22:27:00,369 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-21 22:27:00,370 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-21 22:27:00,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:00,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:00,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:27:00,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:00,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1096197985, now seen corresponding path program 1 times [2023-11-21 22:27:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822071321] [2023-11-21 22:27:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:00,444 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-21 22:27:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:00,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822071321] [2023-11-21 22:27:00,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822071321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:00,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:00,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798401604] [2023-11-21 22:27:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:00,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:00,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:27:00,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:00,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:27:00,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:00,761 INFO L124 PetriNetUnfolderBase]: 698/1394 cut-off events. [2023-11-21 22:27:00,761 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-21 22:27:00,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 1394 events. 698/1394 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9233 event pairs, 324 based on Foata normal form. 0/1371 useless extension candidates. Maximal degree in co-relation 2562. Up to 890 conditions per place. [2023-11-21 22:27:00,775 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-21 22:27:00,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 166 flow [2023-11-21 22:27:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-11-21 22:27:00,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-21 22:27:00,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-11-21 22:27:00,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-11-21 22:27:00,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:00,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-11-21 22:27:00,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,779 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 108 transitions. [2023-11-21 22:27:00,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 166 flow [2023-11-21 22:27:00,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:00,783 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-21 22:27:00,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-21 22:27:00,786 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-21 22:27:00,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-21 22:27:00,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:00,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:00,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:27:00,788 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:00,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:00,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1096197986, now seen corresponding path program 1 times [2023-11-21 22:27:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903690539] [2023-11-21 22:27:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:00,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-21 22:27:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903690539] [2023-11-21 22:27:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903690539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703178758] [2023-11-21 22:27:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:00,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:00,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-21 22:27:00,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:00,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:00,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-21 22:27:00,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:01,173 INFO L124 PetriNetUnfolderBase]: 676/1342 cut-off events. [2023-11-21 22:27:01,174 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-21 22:27:01,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 1342 events. 676/1342 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8980 event pairs, 408 based on Foata normal form. 15/1328 useless extension candidates. Maximal degree in co-relation 2461. Up to 853 conditions per place. [2023-11-21 22:27:01,186 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-21 22:27:01,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 160 flow [2023-11-21 22:27:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-21 22:27:01,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-21 22:27:01,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-21 22:27:01,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-21 22:27:01,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:01,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-21 22:27:01,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:01,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:01,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:01,191 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 110 transitions. [2023-11-21 22:27:01,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 160 flow [2023-11-21 22:27:01,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:01,194 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-21 22:27:01,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-21 22:27:01,195 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-21 22:27:01,195 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-21 22:27:01,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:01,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:01,196 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-21 22:27:01,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:27:01,197 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:01,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1002153647, now seen corresponding path program 1 times [2023-11-21 22:27:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303358956] [2023-11-21 22:27:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:01,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:01,743 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-21 22:27:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303358956] [2023-11-21 22:27:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303358956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:01,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:27:01,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689615562] [2023-11-21 22:27:01,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:01,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:27:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:01,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:27:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:27:01,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:27:01,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:01,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:01,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:27:01,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:02,575 INFO L124 PetriNetUnfolderBase]: 1095/2090 cut-off events. [2023-11-21 22:27:02,575 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-21 22:27:02,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 2090 events. 1095/2090 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14823 event pairs, 342 based on Foata normal form. 45/2102 useless extension candidates. Maximal degree in co-relation 3901. Up to 667 conditions per place. [2023-11-21 22:27:02,593 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 46 selfloop transitions, 5 changer transitions 10/78 dead transitions. [2023-11-21 22:27:02,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 298 flow [2023-11-21 22:27:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:27:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:27:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2023-11-21 22:27:02,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576819407008087 [2023-11-21 22:27:02,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 244 transitions. [2023-11-21 22:27:02,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 244 transitions. [2023-11-21 22:27:02,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:02,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 244 transitions. [2023-11-21 22:27:02,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:02,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:02,599 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:02,599 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 7 states and 244 transitions. [2023-11-21 22:27:02,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 298 flow [2023-11-21 22:27:02,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:02,602 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 112 flow [2023-11-21 22:27:02,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-11-21 22:27:02,604 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-21 22:27:02,604 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 112 flow [2023-11-21 22:27:02,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:02,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:02,605 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-21 22:27:02,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:27:02,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:02,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1002154029, now seen corresponding path program 1 times [2023-11-21 22:27:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:02,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932285391] [2023-11-21 22:27:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:02,834 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-21 22:27:02,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932285391] [2023-11-21 22:27:02,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932285391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165794748] [2023-11-21 22:27:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:27:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:27:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:27:02,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-21 22:27:02,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:02,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-21 22:27:02,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:03,779 INFO L124 PetriNetUnfolderBase]: 2575/4389 cut-off events. [2023-11-21 22:27:03,780 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2023-11-21 22:27:03,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8771 conditions, 4389 events. 2575/4389 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30981 event pairs, 1412 based on Foata normal form. 0/4221 useless extension candidates. Maximal degree in co-relation 8756. Up to 2793 conditions per place. [2023-11-21 22:27:03,817 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 41 selfloop transitions, 6 changer transitions 37/99 dead transitions. [2023-11-21 22:27:03,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 434 flow [2023-11-21 22:27:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:27:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:27:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2023-11-21 22:27:03,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6485849056603774 [2023-11-21 22:27:03,820 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 275 transitions. [2023-11-21 22:27:03,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 275 transitions. [2023-11-21 22:27:03,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:03,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 275 transitions. [2023-11-21 22:27:03,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:03,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:03,824 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:03,824 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 112 flow. Second operand 8 states and 275 transitions. [2023-11-21 22:27:03,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 434 flow [2023-11-21 22:27:03,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 426 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-21 22:27:03,830 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 158 flow [2023-11-21 22:27:03,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2023-11-21 22:27:03,832 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-21 22:27:03,833 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 158 flow [2023-11-21 22:27:03,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:03,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:03,834 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] [2023-11-21 22:27:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:27:03,834 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:03,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash 586343058, now seen corresponding path program 1 times [2023-11-21 22:27:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857838722] [2023-11-21 22:27:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:04,132 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-21 22:27:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857838722] [2023-11-21 22:27:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857838722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:04,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:27:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70732134] [2023-11-21 22:27:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:04,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:27:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:27:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:27:04,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-21 22:27:04,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 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-21 22:27:04,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:04,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-21 22:27:04,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:06,114 INFO L124 PetriNetUnfolderBase]: 4648/7526 cut-off events. [2023-11-21 22:27:06,114 INFO L125 PetriNetUnfolderBase]: For 5795/5795 co-relation queries the response was YES. [2023-11-21 22:27:06,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18205 conditions, 7526 events. 4648/7526 cut-off events. For 5795/5795 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 52414 event pairs, 323 based on Foata normal form. 148/7651 useless extension candidates. Maximal degree in co-relation 18186. Up to 3152 conditions per place. [2023-11-21 22:27:06,185 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 119 selfloop transitions, 52 changer transitions 20/205 dead transitions. [2023-11-21 22:27:06,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 205 transitions, 1138 flow [2023-11-21 22:27:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:27:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-21 22:27:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 579 transitions. [2023-11-21 22:27:06,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6426193118756937 [2023-11-21 22:27:06,190 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 579 transitions. [2023-11-21 22:27:06,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 579 transitions. [2023-11-21 22:27:06,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:06,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 579 transitions. [2023-11-21 22:27:06,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 34.05882352941177) internal successors, (579), 17 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:06,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:06,198 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:06,198 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 158 flow. Second operand 17 states and 579 transitions. [2023-11-21 22:27:06,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 205 transitions, 1138 flow [2023-11-21 22:27:06,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 205 transitions, 1076 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-21 22:27:06,244 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 607 flow [2023-11-21 22:27:06,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=607, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2023-11-21 22:27:06,246 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-21 22:27:06,246 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 607 flow [2023-11-21 22:27:06,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 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-21 22:27:06,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:06,249 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-21 22:27:06,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:27:06,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:06,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash -596313917, now seen corresponding path program 1 times [2023-11-21 22:27:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564905565] [2023-11-21 22:27:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:06,593 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-21 22:27:06,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564905565] [2023-11-21 22:27:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564905565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:27:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383386706] [2023-11-21 22:27:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:27:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:27:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:27:06,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-21 22:27:06,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:06,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:06,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-21 22:27:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:08,892 INFO L124 PetriNetUnfolderBase]: 6055/10156 cut-off events. [2023-11-21 22:27:08,892 INFO L125 PetriNetUnfolderBase]: For 58164/58167 co-relation queries the response was YES. [2023-11-21 22:27:08,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39526 conditions, 10156 events. 6055/10156 cut-off events. For 58164/58167 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 76950 event pairs, 581 based on Foata normal form. 248/10338 useless extension candidates. Maximal degree in co-relation 39493. Up to 2116 conditions per place. [2023-11-21 22:27:09,010 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 127 selfloop transitions, 39 changer transitions 14/194 dead transitions. [2023-11-21 22:27:09,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1773 flow [2023-11-21 22:27:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:27:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-21 22:27:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 376 transitions. [2023-11-21 22:27:09,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6449399656946827 [2023-11-21 22:27:09,014 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 376 transitions. [2023-11-21 22:27:09,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 376 transitions. [2023-11-21 22:27:09,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:09,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 376 transitions. [2023-11-21 22:27:09,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 34.18181818181818) internal successors, (376), 11 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:09,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:09,019 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:09,019 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 607 flow. Second operand 11 states and 376 transitions. [2023-11-21 22:27:09,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1773 flow [2023-11-21 22:27:09,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 194 transitions, 1747 flow, removed 13 selfloop flow, removed 0 redundant places. [2023-11-21 22:27:09,192 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 805 flow [2023-11-21 22:27:09,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=805, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2023-11-21 22:27:09,193 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 43 predicate places. [2023-11-21 22:27:09,193 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 805 flow [2023-11-21 22:27:09,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:09,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:09,194 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-21 22:27:09,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:27:09,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:09,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash 129631231, now seen corresponding path program 1 times [2023-11-21 22:27:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353454267] [2023-11-21 22:27:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:09,837 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-21 22:27:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353454267] [2023-11-21 22:27:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353454267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:27:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842006493] [2023-11-21 22:27:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:09,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:27:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:27:09,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:27:10,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-21 22:27:10,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 805 flow. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:10,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:10,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-21 22:27:10,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:11,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([393] L860-->L863: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_3 0) (= v_~__unbuffered_p1_EBX~0_3 0) (= v_~__unbuffered_p1_EAX~0_3 1) (= v_~__unbuffered_p0_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [42#L763true, 192#true, 124#true, 49#L820true, Black: 139#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 145#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 131#(and (= ~x~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 133#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 149#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 151#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 143#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 141#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 127#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), 16#L803true, Black: 101#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t1740~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t1741~0#1.base|) 0)) (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0))), Black: 126#(= ~x~0 0), Black: 98#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|))), Black: 97#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= ~__unbuffered_p1_EAX~0 1))), 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 113#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 115#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), P0Thread1of1ForFork1InUse, 13#L863true, Black: 109#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), Black: 180#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 168#true, Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork2InUse, Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-21 22:27:11,124 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-21 22:27:11,124 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-21 22:27:11,124 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-21 22:27:11,124 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-21 22:27:11,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([393] L860-->L863: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_3 0) (= v_~__unbuffered_p1_EBX~0_3 0) (= v_~__unbuffered_p1_EAX~0_3 1) (= v_~__unbuffered_p0_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [18#P0EXITtrue, 192#true, 124#true, 49#L820true, Black: 139#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 145#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 131#(and (= ~x~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 133#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 149#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 151#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 143#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 141#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 127#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), 16#L803true, Black: 101#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t1740~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t1741~0#1.base|) 0)) (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0))), Black: 126#(= ~x~0 0), Black: 98#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|))), Black: 97#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= ~__unbuffered_p1_EAX~0 1))), 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 113#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 115#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 13#L863true, Black: 109#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), P0Thread1of1ForFork1InUse, Black: 180#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 168#true, Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork2InUse, Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-21 22:27:11,707 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-21 22:27:11,708 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-21 22:27:11,708 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-21 22:27:11,708 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-21 22:27:12,431 INFO L124 PetriNetUnfolderBase]: 6009/11089 cut-off events. [2023-11-21 22:27:12,431 INFO L125 PetriNetUnfolderBase]: For 66567/67689 co-relation queries the response was YES. [2023-11-21 22:27:12,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42940 conditions, 11089 events. 6009/11089 cut-off events. For 66567/67689 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 96847 event pairs, 2159 based on Foata normal form. 253/10880 useless extension candidates. Maximal degree in co-relation 42900. Up to 4694 conditions per place. [2023-11-21 22:27:12,534 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 72 selfloop transitions, 10 changer transitions 51/169 dead transitions. [2023-11-21 22:27:12,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 169 transitions, 1501 flow [2023-11-21 22:27:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:27:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:27:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2023-11-21 22:27:12,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6361185983827493 [2023-11-21 22:27:12,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 236 transitions. [2023-11-21 22:27:12,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 236 transitions. [2023-11-21 22:27:12,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:12,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 236 transitions. [2023-11-21 22:27:12,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:12,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:12,541 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:12,541 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 805 flow. Second operand 7 states and 236 transitions. [2023-11-21 22:27:12,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 169 transitions, 1501 flow [2023-11-21 22:27:13,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 169 transitions, 1429 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-21 22:27:13,276 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 697 flow [2023-11-21 22:27:13,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=697, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2023-11-21 22:27:13,279 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 50 predicate places. [2023-11-21 22:27:13,279 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 697 flow [2023-11-21 22:27:13,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:13,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:13,280 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] [2023-11-21 22:27:13,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:27:13,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:13,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1854980049, now seen corresponding path program 1 times [2023-11-21 22:27:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636329119] [2023-11-21 22:27:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:13,624 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-21 22:27:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636329119] [2023-11-21 22:27:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636329119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:27:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979745325] [2023-11-21 22:27:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:13,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:27:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:13,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:27:13,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:27:13,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-21 22:27:13,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:13,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:13,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-21 22:27:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:14,883 INFO L124 PetriNetUnfolderBase]: 3490/5997 cut-off events. [2023-11-21 22:27:14,883 INFO L125 PetriNetUnfolderBase]: For 34741/34767 co-relation queries the response was YES. [2023-11-21 22:27:14,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24221 conditions, 5997 events. 3490/5997 cut-off events. For 34741/34767 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 43794 event pairs, 1898 based on Foata normal form. 72/5945 useless extension candidates. Maximal degree in co-relation 24179. Up to 3805 conditions per place. [2023-11-21 22:27:14,955 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 69 selfloop transitions, 16 changer transitions 33/141 dead transitions. [2023-11-21 22:27:14,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 1273 flow [2023-11-21 22:27:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:27:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:27:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2023-11-21 22:27:14,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6273584905660378 [2023-11-21 22:27:14,958 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 266 transitions. [2023-11-21 22:27:14,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 266 transitions. [2023-11-21 22:27:14,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:14,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 266 transitions. [2023-11-21 22:27:14,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:14,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:14,962 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:14,962 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 697 flow. Second operand 8 states and 266 transitions. [2023-11-21 22:27:14,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 1273 flow [2023-11-21 22:27:15,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 141 transitions, 1171 flow, removed 46 selfloop flow, removed 6 redundant places. [2023-11-21 22:27:15,096 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 658 flow [2023-11-21 22:27:15,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=658, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2023-11-21 22:27:15,097 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 52 predicate places. [2023-11-21 22:27:15,097 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 658 flow [2023-11-21 22:27:15,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:15,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:15,098 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-21 22:27:15,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:27:15,098 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:15,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1809295678, now seen corresponding path program 1 times [2023-11-21 22:27:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673903538] [2023-11-21 22:27:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:15,642 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-21 22:27:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673903538] [2023-11-21 22:27:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673903538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:27:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274545724] [2023-11-21 22:27:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:15,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:27:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:27:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:27:15,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2023-11-21 22:27:15,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 658 flow. Second operand has 9 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 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-21 22:27:15,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:15,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2023-11-21 22:27:15,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:17,032 INFO L124 PetriNetUnfolderBase]: 3003/5479 cut-off events. [2023-11-21 22:27:17,032 INFO L125 PetriNetUnfolderBase]: For 21067/21823 co-relation queries the response was YES. [2023-11-21 22:27:17,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19754 conditions, 5479 events. 3003/5479 cut-off events. For 21067/21823 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 41626 event pairs, 1432 based on Foata normal form. 107/5426 useless extension candidates. Maximal degree in co-relation 19724. Up to 2520 conditions per place. [2023-11-21 22:27:17,085 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 28 selfloop transitions, 4 changer transitions 88/136 dead transitions. [2023-11-21 22:27:17,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 1158 flow [2023-11-21 22:27:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:27:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:27:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2023-11-21 22:27:17,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5636792452830188 [2023-11-21 22:27:17,088 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 239 transitions. [2023-11-21 22:27:17,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 239 transitions. [2023-11-21 22:27:17,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:17,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 239 transitions. [2023-11-21 22:27:17,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:17,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:17,092 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:17,092 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 658 flow. Second operand 8 states and 239 transitions. [2023-11-21 22:27:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 1158 flow [2023-11-21 22:27:17,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 1088 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-11-21 22:27:17,205 INFO L231 Difference]: Finished difference. Result has 100 places, 45 transitions, 282 flow [2023-11-21 22:27:17,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=100, PETRI_TRANSITIONS=45} [2023-11-21 22:27:17,206 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 42 predicate places. [2023-11-21 22:27:17,207 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 45 transitions, 282 flow [2023-11-21 22:27:17,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 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-21 22:27:17,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:17,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:17,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:27:17,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:17,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash 213137461, now seen corresponding path program 1 times [2023-11-21 22:27:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:17,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367230516] [2023-11-21 22:27:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:17,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-21 22:27:17,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:17,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367230516] [2023-11-21 22:27:17,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367230516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:17,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:17,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:27:17,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847424658] [2023-11-21 22:27:17,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:17,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:17,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:17,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-21 22:27:17,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 45 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:17,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:17,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-21 22:27:17,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:18,456 INFO L124 PetriNetUnfolderBase]: 2935/4818 cut-off events. [2023-11-21 22:27:18,457 INFO L125 PetriNetUnfolderBase]: For 16258/16898 co-relation queries the response was YES. [2023-11-21 22:27:18,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15020 conditions, 4818 events. 2935/4818 cut-off events. For 16258/16898 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 30220 event pairs, 399 based on Foata normal form. 208/4898 useless extension candidates. Maximal degree in co-relation 14996. Up to 2526 conditions per place. [2023-11-21 22:27:18,499 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 47 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-11-21 22:27:18,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 526 flow [2023-11-21 22:27:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-21 22:27:18,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-21 22:27:18,502 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-21 22:27:18,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-21 22:27:18,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:18,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-21 22:27:18,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:18,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:18,504 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:18,505 INFO L175 Difference]: Start difference. First operand has 100 places, 45 transitions, 282 flow. Second operand 4 states and 144 transitions. [2023-11-21 22:27:18,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 526 flow [2023-11-21 22:27:18,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 426 flow, removed 18 selfloop flow, removed 19 redundant places. [2023-11-21 22:27:18,531 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 251 flow [2023-11-21 22:27:18,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-11-21 22:27:18,533 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-21 22:27:18,533 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 251 flow [2023-11-21 22:27:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:18,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:18,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:18,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:27:18,534 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:18,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1012661220, now seen corresponding path program 1 times [2023-11-21 22:27:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917208097] [2023-11-21 22:27:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:18,763 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-21 22:27:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917208097] [2023-11-21 22:27:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917208097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562484805] [2023-11-21 22:27:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:18,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:27:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:27:18,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:27:18,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-21 22:27:18,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:18,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:18,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-21 22:27:18,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:19,377 INFO L124 PetriNetUnfolderBase]: 2161/3612 cut-off events. [2023-11-21 22:27:19,378 INFO L125 PetriNetUnfolderBase]: For 6578/6860 co-relation queries the response was YES. [2023-11-21 22:27:19,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10895 conditions, 3612 events. 2161/3612 cut-off events. For 6578/6860 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21565 event pairs, 236 based on Foata normal form. 182/3699 useless extension candidates. Maximal degree in co-relation 10879. Up to 1149 conditions per place. [2023-11-21 22:27:19,394 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 56 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2023-11-21 22:27:19,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 519 flow [2023-11-21 22:27:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:27:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:27:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-21 22:27:19,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830188679245283 [2023-11-21 22:27:19,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-21 22:27:19,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-21 22:27:19,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:19,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-21 22:27:19,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:19,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:19,398 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:19,399 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 251 flow. Second operand 5 states and 181 transitions. [2023-11-21 22:27:19,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 519 flow [2023-11-21 22:27:19,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 80 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:19,406 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 285 flow [2023-11-21 22:27:19,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-11-21 22:27:19,407 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2023-11-21 22:27:19,407 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 285 flow [2023-11-21 22:27:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:19,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:19,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:19,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:27:19,408 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:19,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1637578540, now seen corresponding path program 1 times [2023-11-21 22:27:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182775093] [2023-11-21 22:27:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:19,638 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-21 22:27:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182775093] [2023-11-21 22:27:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182775093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:27:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496398170] [2023-11-21 22:27:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:19,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:27:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:27:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:27:19,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-21 22:27:19,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:19,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:19,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-21 22:27:19,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:20,197 INFO L124 PetriNetUnfolderBase]: 1637/2680 cut-off events. [2023-11-21 22:27:20,198 INFO L125 PetriNetUnfolderBase]: For 6894/7156 co-relation queries the response was YES. [2023-11-21 22:27:20,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9037 conditions, 2680 events. 1637/2680 cut-off events. For 6894/7156 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15103 event pairs, 206 based on Foata normal form. 108/2701 useless extension candidates. Maximal degree in co-relation 9019. Up to 968 conditions per place. [2023-11-21 22:27:20,214 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 49 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2023-11-21 22:27:20,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 507 flow [2023-11-21 22:27:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:27:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:27:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-21 22:27:20,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352201257861635 [2023-11-21 22:27:20,218 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-21 22:27:20,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-21 22:27:20,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:20,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-21 22:27:20,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:20,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:20,221 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:20,221 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 285 flow. Second operand 6 states and 202 transitions. [2023-11-21 22:27:20,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 507 flow [2023-11-21 22:27:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 467 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-21 22:27:20,230 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 275 flow [2023-11-21 22:27:20,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2023-11-21 22:27:20,230 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2023-11-21 22:27:20,231 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 275 flow [2023-11-21 22:27:20,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:20,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:20,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:20,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:27:20,232 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:20,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash 393894116, now seen corresponding path program 1 times [2023-11-21 22:27:20,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:20,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225823291] [2023-11-21 22:27:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:20,569 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-21 22:27:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225823291] [2023-11-21 22:27:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225823291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:27:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174481779] [2023-11-21 22:27:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:20,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:27:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:27:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:27:20,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-21 22:27:20,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:20,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:20,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-21 22:27:20,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:21,131 INFO L124 PetriNetUnfolderBase]: 1524/2949 cut-off events. [2023-11-21 22:27:21,132 INFO L125 PetriNetUnfolderBase]: For 5792/6154 co-relation queries the response was YES. [2023-11-21 22:27:21,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 2949 events. 1524/2949 cut-off events. For 5792/6154 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 20636 event pairs, 538 based on Foata normal form. 61/2729 useless extension candidates. Maximal degree in co-relation 8723. Up to 1301 conditions per place. [2023-11-21 22:27:21,150 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 34 selfloop transitions, 10 changer transitions 11/76 dead transitions. [2023-11-21 22:27:21,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 470 flow [2023-11-21 22:27:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:27:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:27:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2023-11-21 22:27:21,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5795148247978437 [2023-11-21 22:27:21,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 215 transitions. [2023-11-21 22:27:21,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 215 transitions. [2023-11-21 22:27:21,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:21,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 215 transitions. [2023-11-21 22:27:21,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 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-21 22:27:21,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:21,156 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:21,156 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 275 flow. Second operand 7 states and 215 transitions. [2023-11-21 22:27:21,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 470 flow [2023-11-21 22:27:21,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 404 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-11-21 22:27:21,176 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 282 flow [2023-11-21 22:27:21,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2023-11-21 22:27:21,177 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-21 22:27:21,177 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 282 flow [2023-11-21 22:27:21,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:21,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:21,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:21,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:27:21,177 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:21,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -432247248, now seen corresponding path program 2 times [2023-11-21 22:27:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117665974] [2023-11-21 22:27:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:22,581 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-21 22:27:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117665974] [2023-11-21 22:27:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117665974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 22:27:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390217867] [2023-11-21 22:27:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:22,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:27:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:27:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:27:22,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:27:22,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 282 flow. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 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-21 22:27:22,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:22,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:27:22,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:23,490 INFO L124 PetriNetUnfolderBase]: 1827/3703 cut-off events. [2023-11-21 22:27:23,490 INFO L125 PetriNetUnfolderBase]: For 4110/4807 co-relation queries the response was YES. [2023-11-21 22:27:23,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 3703 events. 1827/3703 cut-off events. For 4110/4807 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 29200 event pairs, 582 based on Foata normal form. 86/3383 useless extension candidates. Maximal degree in co-relation 9762. Up to 1470 conditions per place. [2023-11-21 22:27:23,509 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 35 selfloop transitions, 13 changer transitions 39/115 dead transitions. [2023-11-21 22:27:23,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 692 flow [2023-11-21 22:27:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:27:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-21 22:27:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 393 transitions. [2023-11-21 22:27:23,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6179245283018868 [2023-11-21 22:27:23,514 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 393 transitions. [2023-11-21 22:27:23,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 393 transitions. [2023-11-21 22:27:23,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:23,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 393 transitions. [2023-11-21 22:27:23,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 32.75) internal successors, (393), 12 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:23,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:23,520 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:23,520 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 282 flow. Second operand 12 states and 393 transitions. [2023-11-21 22:27:23,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 692 flow [2023-11-21 22:27:23,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 672 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-21 22:27:23,528 INFO L231 Difference]: Finished difference. Result has 91 places, 60 transitions, 389 flow [2023-11-21 22:27:23,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=389, PETRI_PLACES=91, PETRI_TRANSITIONS=60} [2023-11-21 22:27:23,529 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-21 22:27:23,529 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 60 transitions, 389 flow [2023-11-21 22:27:23,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 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-21 22:27:23,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:23,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:23,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:27:23,530 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:23,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash -431898152, now seen corresponding path program 3 times [2023-11-21 22:27:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648469062] [2023-11-21 22:27:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:25,204 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-21 22:27:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648469062] [2023-11-21 22:27:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648469062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:25,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 22:27:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402965091] [2023-11-21 22:27:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:27:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:27:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:27:25,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:27:25,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 60 transitions, 389 flow. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 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-21 22:27:25,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:25,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:27:25,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:26,181 INFO L124 PetriNetUnfolderBase]: 1394/2883 cut-off events. [2023-11-21 22:27:26,181 INFO L125 PetriNetUnfolderBase]: For 6203/6725 co-relation queries the response was YES. [2023-11-21 22:27:26,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8523 conditions, 2883 events. 1394/2883 cut-off events. For 6203/6725 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 21637 event pairs, 416 based on Foata normal form. 81/2584 useless extension candidates. Maximal degree in co-relation 8498. Up to 1306 conditions per place. [2023-11-21 22:27:26,199 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 37 selfloop transitions, 19 changer transitions 21/105 dead transitions. [2023-11-21 22:27:26,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 105 transitions, 755 flow [2023-11-21 22:27:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:27:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-21 22:27:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 377 transitions. [2023-11-21 22:27:26,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5927672955974843 [2023-11-21 22:27:26,201 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 377 transitions. [2023-11-21 22:27:26,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 377 transitions. [2023-11-21 22:27:26,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:26,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 377 transitions. [2023-11-21 22:27:26,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 31.416666666666668) internal successors, (377), 12 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:26,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:26,205 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:26,205 INFO L175 Difference]: Start difference. First operand has 91 places, 60 transitions, 389 flow. Second operand 12 states and 377 transitions. [2023-11-21 22:27:26,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 105 transitions, 755 flow [2023-11-21 22:27:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 105 transitions, 708 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-11-21 22:27:26,217 INFO L231 Difference]: Finished difference. Result has 95 places, 69 transitions, 501 flow [2023-11-21 22:27:26,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=501, PETRI_PLACES=95, PETRI_TRANSITIONS=69} [2023-11-21 22:27:26,218 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-21 22:27:26,219 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 501 flow [2023-11-21 22:27:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 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-21 22:27:26,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:26,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 22:27:26,220 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:26,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2116193814, now seen corresponding path program 4 times [2023-11-21 22:27:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930880346] [2023-11-21 22:27:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:26,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:27:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:26,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:27:26,374 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:27:26,375 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-21 22:27:26,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-21 22:27:26,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-21 22:27:26,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-21 22:27:26,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-21 22:27:26,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-21 22:27:26,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-21 22:27:26,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-21 22:27:26,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-21 22:27:26,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-21 22:27:26,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-21 22:27:26,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-21 22:27:26,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-21 22:27:26,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 22:27:26,380 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:26,386 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:27:26,386 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:27:26,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:27:26,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 22:27:26,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 22:27:26,459 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:27:26,460 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:27:26,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:27:26 BasicIcfg [2023-11-21 22:27:26,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:27:26,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:27:26,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:27:26,478 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:27:26,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:26:56" (3/4) ... [2023-11-21 22:27:26,480 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:27:26,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:27:26,482 INFO L158 Benchmark]: Toolchain (without parser) took 31688.31ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 104.5MB in the beginning and 828.4MB in the end (delta: -724.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-21 22:27:26,482 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 107.0MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:27:26,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.57ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 79.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-21 22:27:26,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.14ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 76.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:27:26,483 INFO L158 Benchmark]: Boogie Preprocessor took 74.01ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:27:26,484 INFO L158 Benchmark]: RCFGBuilder took 1030.22ms. Allocated memory is still 142.6MB. Free memory was 74.8MB in the beginning and 110.7MB in the end (delta: -35.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-11-21 22:27:26,484 INFO L158 Benchmark]: TraceAbstraction took 29706.25ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 109.9MB in the beginning and 828.4MB in the end (delta: -718.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-21 22:27:26,485 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 1.9GB. Free memory is still 828.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:27:26,486 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.26ms. Allocated memory is still 107.0MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.57ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 79.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.14ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 76.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.01ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 74.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.22ms. Allocated memory is still 142.6MB. Free memory was 74.8MB in the beginning and 110.7MB in the end (delta: -35.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29706.25ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 109.9MB in the beginning and 828.4MB in the end (delta: -718.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 1.9GB. Free memory is still 828.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={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] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={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] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={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] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 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) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3: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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3: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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3: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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 847]: 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: 849]: 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, 77 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: 29.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1269 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1112 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3678 IncrementalHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 29 mSDtfsCounter, 3678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=805occurred in iteration=11, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 22:27:26,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx --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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:27:29,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:27:29,300 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 22:27:29,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:27:29,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:27:29,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:27:29,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:27:29,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:27:29,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:27:29,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:27:29,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:27:29,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:27:29,368 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:27:29,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:27:29,369 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:27:29,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:27:29,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:27:29,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:27:29,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:27:29,372 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:27:29,373 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:27:29,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:27:29,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:27:29,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 22:27:29,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 22:27:29,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:27:29,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:27:29,377 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:27:29,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:27:29,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:27:29,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:27:29,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:27:29,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:27:29,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:27:29,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:27:29,381 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 22:27:29,382 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 22:27:29,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:27:29,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:27:29,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:27:29,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:27:29,384 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 22:27:29,384 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_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/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_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx 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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2023-11-21 22:27:29,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:27:29,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:27:29,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:27:29,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:27:29,778 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:27:29,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-21 22:27:32,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:27:33,204 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:27:33,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-21 22:27:33,235 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data/58bbb66e0/3a5c8a58dfd24bdd8cf4d4844430e754/FLAGb83d4f6e2 [2023-11-21 22:27:33,249 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/data/58bbb66e0/3a5c8a58dfd24bdd8cf4d4844430e754 [2023-11-21 22:27:33,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:27:33,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:27:33,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:27:33,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:27:33,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:27:33,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:27:33" (1/1) ... [2023-11-21 22:27:33,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f928c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:33, skipping insertion in model container [2023-11-21 22:27:33,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:27:33" (1/1) ... [2023-11-21 22:27:33,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:27:33,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:27:33,932 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:27:34,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:27:34,075 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:27:34,075 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:27:34,084 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:27:34,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34 WrapperNode [2023-11-21 22:27:34,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:27:34,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:27:34,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:27:34,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:27:34,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,180 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-11-21 22:27:34,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:27:34,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:27:34,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:27:34,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:27:34,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:27:34,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:27:34,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:27:34,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:27:34,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (1/1) ... [2023-11-21 22:27:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:27:34,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:27:34,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:27:34,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:27:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:27:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:27:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:27:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:27:34,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 22:27:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 22:27:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:27:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:27:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:27:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:27:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:27:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:27:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:27:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:27:34,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:27:34,340 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:27:34,520 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:27:34,523 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:27:34,912 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:27:35,241 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:27:35,241 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:27:35,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:27:35 BoogieIcfgContainer [2023-11-21 22:27:35,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:27:35,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:27:35,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:27:35,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:27:35,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:27:33" (1/3) ... [2023-11-21 22:27:35,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac538f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:27:35, skipping insertion in model container [2023-11-21 22:27:35,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:34" (2/3) ... [2023-11-21 22:27:35,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac538f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:27:35, skipping insertion in model container [2023-11-21 22:27:35,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:27:35" (3/3) ... [2023-11-21 22:27:35,263 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-21 22:27:35,284 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:27:35,285 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 22:27:35,285 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:27:35,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:27:35,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-21 22:27:35,459 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-21 22:27:35,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:35,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-21 22:27:35,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-21 22:27:35,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-21 22:27:35,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:27:35,501 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;@1685ce7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:27:35,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-21 22:27:35,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:27:35,505 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:27:35,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:35,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:35,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:27:35,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:35,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 13302, now seen corresponding path program 1 times [2023-11-21 22:27:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814772190] [2023-11-21 22:27:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:35,532 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-21 22:27:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:35,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat -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-21 22:27:35,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat -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-21 22:27:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:35,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:27:35,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:35,737 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-21 22:27:35,749 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-21 22:27:35,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:35,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814772190] [2023-11-21 22:27:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814772190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:35,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:27:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591689179] [2023-11-21 22:27:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:35,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:35,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-21 22:27:35,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:35,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:35,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-21 22:27:35,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:36,504 INFO L124 PetriNetUnfolderBase]: 941/1842 cut-off events. [2023-11-21 22:27:36,504 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-21 22:27:36,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 1842 events. 941/1842 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12798 event pairs, 707 based on Foata normal form. 108/1810 useless extension candidates. Maximal degree in co-relation 3294. Up to 1075 conditions per place. [2023-11-21 22:27:36,531 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-21 22:27:36,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 183 flow [2023-11-21 22:27:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:27:36,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-21 22:27:36,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:27:36,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:27:36,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:36,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:27:36,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:36,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:36,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:36,565 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:27:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 183 flow [2023-11-21 22:27:36,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 22:27:36,579 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-21 22:27:36,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-21 22:27:36,586 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-21 22:27:36,586 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-21 22:27:36,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:36,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:36,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:27:36,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat -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-21 22:27:36,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat -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-21 22:27:36,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 22:27:36,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash 13303, now seen corresponding path program 1 times [2023-11-21 22:27:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:36,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078401593] [2023-11-21 22:27:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:36,795 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-21 22:27:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:36,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat -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-21 22:27:36,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646a9467-c953-4d1a-8fcb-c359cdf61ed9/bin/uautomizer-verify-bycVGegfSx/mathsat -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-21 22:27:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:36,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:27:36,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:36,937 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-21 22:27:36,951 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-21 22:27:36,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:36,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078401593] [2023-11-21 22:27:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078401593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:27:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804150505] [2023-11-21 22:27:36,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:36,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:36,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-21 22:27:37,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:37,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:37,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-21 22:27:37,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand