./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl --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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:18:25,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:18:25,690 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:18:25,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:18:25,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:18:25,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:18:25,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:18:25,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:18:25,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:18:25,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:18:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:18:25,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:18:25,750 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:18:25,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:18:25,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:18:25,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:18:25,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:18:25,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:18:25,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:18:25,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:18:25,755 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:18:25,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:18:25,756 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:18:25,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:18:25,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:18:25,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:18:25,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:18:25,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:18:25,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:18:25,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:25,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:18:25,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:18:25,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:18:25,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:18:25,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:18:25,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:18:25,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:18:25,774 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:18:25,774 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_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/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_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2023-11-12 02:18:26,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:18:26,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:18:26,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:18:26,062 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:18:26,063 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:18:26,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:18:29,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:18:29,465 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:18:29,466 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:18:29,491 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data/81618179b/3d30a895f72d440e8b651605298d7f5b/FLAG7e8848732 [2023-11-12 02:18:29,507 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data/81618179b/3d30a895f72d440e8b651605298d7f5b [2023-11-12 02:18:29,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:18:29,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:18:29,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:29,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:18:29,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:18:29,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:29" (1/1) ... [2023-11-12 02:18:29,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf4bfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:29, skipping insertion in model container [2023-11-12 02:18:29,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:29" (1/1) ... [2023-11-12 02:18:29,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:18:30,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:30,080 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:18:30,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:30,206 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:30,206 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:30,215 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:18:30,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30 WrapperNode [2023-11-12 02:18:30,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:30,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:30,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:18:30,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:18:30,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,307 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-12 02:18:30,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:30,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:18:30,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:18:30,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:18:30,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:18:30,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:18:30,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:18:30,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:18:30,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (1/1) ... [2023-11-12 02:18:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:30,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:18:30,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:18:30,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:18:30,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:18:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:18:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:18:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:18:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:18:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:18:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:18:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:18:30,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:18:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:18:30,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:18:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:18:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:18:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:18:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:18:30,474 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:18:30,685 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:18:30,687 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:18:31,115 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:18:31,276 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:18:31,277 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:18:31,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:31 BoogieIcfgContainer [2023-11-12 02:18:31,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:18:31,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:18:31,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:18:31,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:18:31,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:18:29" (1/3) ... [2023-11-12 02:18:31,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68917024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:31, skipping insertion in model container [2023-11-12 02:18:31,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:30" (2/3) ... [2023-11-12 02:18:31,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68917024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:31, skipping insertion in model container [2023-11-12 02:18:31,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:31" (3/3) ... [2023-11-12 02:18:31,290 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:18:31,309 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:18:31,310 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 02:18:31,310 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:18:31,375 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:18:31,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 130 transitions, 272 flow [2023-11-12 02:18:31,514 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2023-11-12 02:18:31,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:31,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-12 02:18:31,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 130 transitions, 272 flow [2023-11-12 02:18:31,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 127 transitions, 263 flow [2023-11-12 02:18:31,538 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:18:31,548 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 127 transitions, 263 flow [2023-11-12 02:18:31,551 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 127 transitions, 263 flow [2023-11-12 02:18:31,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 263 flow [2023-11-12 02:18:31,584 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2023-11-12 02:18:31,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:31,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-12 02:18:31,588 INFO L119 LiptonReduction]: Number of co-enabled transitions 2764 [2023-11-12 02:18:36,941 INFO L134 LiptonReduction]: Checked pairs total: 7616 [2023-11-12 02:18:36,942 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-11-12 02:18:36,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:18:36,995 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;@708d40cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:18:37,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 02:18:37,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:18:37,014 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:18:37,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:37,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:37,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:18:37,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:37,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 582, now seen corresponding path program 1 times [2023-11-12 02:18:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:37,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57865438] [2023-11-12 02:18:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:37,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:37,183 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-12 02:18:37,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57865438] [2023-11-12 02:18:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57865438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:37,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:18:37,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553882380] [2023-11-12 02:18:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:18:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:18:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:18:37,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 262 [2023-11-12 02:18:37,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 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-12 02:18:37,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:37,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 262 [2023-11-12 02:18:37,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:37,773 INFO L124 PetriNetUnfolderBase]: 1616/2387 cut-off events. [2023-11-12 02:18:37,774 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-12 02:18:37,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4811 conditions, 2387 events. 1616/2387 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11397 event pairs, 1616 based on Foata normal form. 0/2011 useless extension candidates. Maximal degree in co-relation 4800. Up to 2368 conditions per place. [2023-11-12 02:18:37,800 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-12 02:18:37,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-11-12 02:18:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:18:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:18:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 262 transitions. [2023-11-12 02:18:37,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-12 02:18:37,817 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 262 transitions. [2023-11-12 02:18:37,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 262 transitions. [2023-11-12 02:18:37,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:37,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 262 transitions. [2023-11-12 02:18:37,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:37,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:37,832 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:37,834 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 262 transitions. [2023-11-12 02:18:37,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-11-12 02:18:37,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:18:37,841 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-12 02:18:37,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-12 02:18:37,848 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-12 02:18:37,848 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-12 02:18:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 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-12 02:18:37,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:37,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-12 02:18:37,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:18:37,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:37,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash 574649, now seen corresponding path program 1 times [2023-11-12 02:18:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106037643] [2023-11-12 02:18:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,206 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-12 02:18:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106037643] [2023-11-12 02:18:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106037643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:18:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972140703] [2023-11-12 02:18:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:38,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:38,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:38,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 262 [2023-11-12 02:18:38,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:38,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:38,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 262 [2023-11-12 02:18:38,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:38,616 INFO L124 PetriNetUnfolderBase]: 1263/1902 cut-off events. [2023-11-12 02:18:38,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:38,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 1902 events. 1263/1902 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8886 event pairs, 562 based on Foata normal form. 0/1737 useless extension candidates. Maximal degree in co-relation 3808. Up to 1510 conditions per place. [2023-11-12 02:18:38,632 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-12 02:18:38,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2023-11-12 02:18:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:18:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-12 02:18:38,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48982188295165396 [2023-11-12 02:18:38,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-12 02:18:38,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-12 02:18:38,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:38,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-12 02:18:38,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:38,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:38,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:38,644 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 385 transitions. [2023-11-12 02:18:38,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2023-11-12 02:18:38,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:18:38,646 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-12 02:18:38,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-12 02:18:38,647 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-12 02:18:38,647 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-12 02:18:38,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:38,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:38,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:38,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:18:38,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:38,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 108057413, now seen corresponding path program 1 times [2023-11-12 02:18:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736303074] [2023-11-12 02:18:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:39,020 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-12 02:18:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736303074] [2023-11-12 02:18:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736303074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:39,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:39,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:18:39,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126260710] [2023-11-12 02:18:39,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:39,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:39,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:39,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 262 [2023-11-12 02:18:39,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:39,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:39,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 262 [2023-11-12 02:18:39,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:39,403 INFO L124 PetriNetUnfolderBase]: 1353/2056 cut-off events. [2023-11-12 02:18:39,403 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-12 02:18:39,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4232 conditions, 2056 events. 1353/2056 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9620 event pairs, 606 based on Foata normal form. 0/1963 useless extension candidates. Maximal degree in co-relation 4228. Up to 1876 conditions per place. [2023-11-12 02:18:39,421 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 34 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-11-12 02:18:39,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 168 flow [2023-11-12 02:18:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:18:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-11-12 02:18:39,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796437659033079 [2023-11-12 02:18:39,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-11-12 02:18:39,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-11-12 02:18:39,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:39,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-11-12 02:18:39,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 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-12 02:18:39,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:39,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:39,431 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 3 states and 377 transitions. [2023-11-12 02:18:39,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 168 flow [2023-11-12 02:18:39,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:39,434 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 73 flow [2023-11-12 02:18:39,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-11-12 02:18:39,436 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-12 02:18:39,436 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 73 flow [2023-11-12 02:18:39,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:39,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:39,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:39,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:18:39,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:39,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash -945189210, now seen corresponding path program 1 times [2023-11-12 02:18:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138192654] [2023-11-12 02:18:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:39,724 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-12 02:18:39,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:39,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138192654] [2023-11-12 02:18:39,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138192654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:39,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:39,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:18:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299083587] [2023-11-12 02:18:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:39,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:39,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:39,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 262 [2023-11-12 02:18:39,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:39,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:39,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 262 [2023-11-12 02:18:39,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:40,478 INFO L124 PetriNetUnfolderBase]: 2802/4133 cut-off events. [2023-11-12 02:18:40,478 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2023-11-12 02:18:40,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9014 conditions, 4133 events. 2802/4133 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19702 event pairs, 585 based on Foata normal form. 106/4239 useless extension candidates. Maximal degree in co-relation 9009. Up to 2061 conditions per place. [2023-11-12 02:18:40,509 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2023-11-12 02:18:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 269 flow [2023-11-12 02:18:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:18:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-11-12 02:18:40,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627862595419847 [2023-11-12 02:18:40,512 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-11-12 02:18:40,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-11-12 02:18:40,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:40,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-11-12 02:18:40,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:40,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:40,519 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:40,519 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 73 flow. Second operand 4 states and 485 transitions. [2023-11-12 02:18:40,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 269 flow [2023-11-12 02:18:40,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:18:40,522 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 146 flow [2023-11-12 02:18:40,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-12 02:18:40,523 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-12 02:18:40,524 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 146 flow [2023-11-12 02:18:40,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:40,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:40,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:40,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:18:40,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:40,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash -945186878, now seen corresponding path program 1 times [2023-11-12 02:18:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840733833] [2023-11-12 02:18:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:40,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:40,982 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-12 02:18:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840733833] [2023-11-12 02:18:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840733833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:18:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847580212] [2023-11-12 02:18:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:40,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:18:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:40,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:18:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:41,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 262 [2023-11-12 02:18:41,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:41,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:41,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 262 [2023-11-12 02:18:41,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:42,067 INFO L124 PetriNetUnfolderBase]: 2311/3577 cut-off events. [2023-11-12 02:18:42,068 INFO L125 PetriNetUnfolderBase]: For 2256/2290 co-relation queries the response was YES. [2023-11-12 02:18:42,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9173 conditions, 3577 events. 2311/3577 cut-off events. For 2256/2290 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 19284 event pairs, 484 based on Foata normal form. 176/3655 useless extension candidates. Maximal degree in co-relation 9166. Up to 2591 conditions per place. [2023-11-12 02:18:42,099 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 42 selfloop transitions, 4 changer transitions 15/67 dead transitions. [2023-11-12 02:18:42,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 378 flow [2023-11-12 02:18:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:18:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2023-11-12 02:18:42,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41857506361323155 [2023-11-12 02:18:42,103 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2023-11-12 02:18:42,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2023-11-12 02:18:42,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:42,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2023-11-12 02:18:42,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,113 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,113 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 146 flow. Second operand 6 states and 658 transitions. [2023-11-12 02:18:42,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 378 flow [2023-11-12 02:18:42,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:18:42,117 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 158 flow [2023-11-12 02:18:42,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-12 02:18:42,118 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-12 02:18:42,119 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 158 flow [2023-11-12 02:18:42,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:42,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:42,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:18:42,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:42,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 294522499, now seen corresponding path program 1 times [2023-11-12 02:18:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250363911] [2023-11-12 02:18:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,285 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-12 02:18:42,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250363911] [2023-11-12 02:18:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250363911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346813568] [2023-11-12 02:18:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:42,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:42,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 262 [2023-11-12 02:18:42,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:42,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 262 [2023-11-12 02:18:42,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:42,822 INFO L124 PetriNetUnfolderBase]: 1227/2044 cut-off events. [2023-11-12 02:18:42,823 INFO L125 PetriNetUnfolderBase]: For 1283/1316 co-relation queries the response was YES. [2023-11-12 02:18:42,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 2044 events. 1227/2044 cut-off events. For 1283/1316 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11217 event pairs, 241 based on Foata normal form. 182/2178 useless extension candidates. Maximal degree in co-relation 5290. Up to 1324 conditions per place. [2023-11-12 02:18:42,840 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 53 selfloop transitions, 8 changer transitions 9/77 dead transitions. [2023-11-12 02:18:42,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 455 flow [2023-11-12 02:18:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:18:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:18:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-11-12 02:18:42,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45267175572519086 [2023-11-12 02:18:42,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-11-12 02:18:42,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-11-12 02:18:42,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:42,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-11-12 02:18:42,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,853 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,853 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 158 flow. Second operand 5 states and 593 transitions. [2023-11-12 02:18:42,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 455 flow [2023-11-12 02:18:42,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 441 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-12 02:18:42,866 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 206 flow [2023-11-12 02:18:42,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-12 02:18:42,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-11-12 02:18:42,870 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 206 flow [2023-11-12 02:18:42,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:42,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:42,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:42,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:18:42,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:42,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1023206814, now seen corresponding path program 1 times [2023-11-12 02:18:42,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:42,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267273946] [2023-11-12 02:18:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,130 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-12 02:18:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267273946] [2023-11-12 02:18:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267273946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:18:43,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672997882] [2023-11-12 02:18:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:43,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:43,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:43,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:43,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 262 [2023-11-12 02:18:43,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:43,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:43,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 262 [2023-11-12 02:18:43,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:43,807 INFO L124 PetriNetUnfolderBase]: 1744/2934 cut-off events. [2023-11-12 02:18:43,807 INFO L125 PetriNetUnfolderBase]: For 3276/3287 co-relation queries the response was YES. [2023-11-12 02:18:43,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9163 conditions, 2934 events. 1744/2934 cut-off events. For 3276/3287 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17468 event pairs, 729 based on Foata normal form. 53/2893 useless extension candidates. Maximal degree in co-relation 9151. Up to 1519 conditions per place. [2023-11-12 02:18:43,836 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 48 selfloop transitions, 6 changer transitions 7/64 dead transitions. [2023-11-12 02:18:43,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 432 flow [2023-11-12 02:18:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:18:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-12 02:18:43,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4821882951653944 [2023-11-12 02:18:43,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-12 02:18:43,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-12 02:18:43,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:43,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-12 02:18:43,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:43,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:43,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:43,844 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 206 flow. Second operand 3 states and 379 transitions. [2023-11-12 02:18:43,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 432 flow [2023-11-12 02:18:43,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:18:43,854 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 208 flow [2023-11-12 02:18:43,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-11-12 02:18:43,855 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-12 02:18:43,855 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 208 flow [2023-11-12 02:18:43,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:43,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:43,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:43,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:18:43,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:43,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1645985902, now seen corresponding path program 1 times [2023-11-12 02:18:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:43,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906185932] [2023-11-12 02:18:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:18:44,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906185932] [2023-11-12 02:18:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906185932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:18:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542795290] [2023-11-12 02:18:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:44,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:44,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 262 [2023-11-12 02:18:44,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:44,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:44,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 262 [2023-11-12 02:18:44,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:44,524 INFO L124 PetriNetUnfolderBase]: 795/1430 cut-off events. [2023-11-12 02:18:44,524 INFO L125 PetriNetUnfolderBase]: For 1606/1617 co-relation queries the response was YES. [2023-11-12 02:18:44,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4486 conditions, 1430 events. 795/1430 cut-off events. For 1606/1617 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7990 event pairs, 137 based on Foata normal form. 128/1519 useless extension candidates. Maximal degree in co-relation 4472. Up to 407 conditions per place. [2023-11-12 02:18:44,534 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 59 selfloop transitions, 11 changer transitions 23/100 dead transitions. [2023-11-12 02:18:44,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 676 flow [2023-11-12 02:18:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-11-12 02:18:44,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4509269356597601 [2023-11-12 02:18:44,539 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-11-12 02:18:44,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-11-12 02:18:44,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:44,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-11-12 02:18:44,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:44,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:44,548 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:44,549 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 208 flow. Second operand 7 states and 827 transitions. [2023-11-12 02:18:44,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 676 flow [2023-11-12 02:18:44,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 634 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-11-12 02:18:44,555 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 268 flow [2023-11-12 02:18:44,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-11-12 02:18:44,557 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-12 02:18:44,557 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 268 flow [2023-11-12 02:18:44,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:44,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:44,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:44,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:18:44,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:44,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash -454471310, now seen corresponding path program 1 times [2023-11-12 02:18:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:44,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305212908] [2023-11-12 02:18:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:44,783 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-12 02:18:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305212908] [2023-11-12 02:18:44,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305212908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:44,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:44,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251958589] [2023-11-12 02:18:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:18:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:18:44,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:18:44,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 262 [2023-11-12 02:18:44,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:44,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:44,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 262 [2023-11-12 02:18:44,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:45,340 INFO L124 PetriNetUnfolderBase]: 1296/2402 cut-off events. [2023-11-12 02:18:45,340 INFO L125 PetriNetUnfolderBase]: For 4473/4493 co-relation queries the response was YES. [2023-11-12 02:18:45,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8591 conditions, 2402 events. 1296/2402 cut-off events. For 4473/4493 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15061 event pairs, 253 based on Foata normal form. 16/2379 useless extension candidates. Maximal degree in co-relation 8575. Up to 1123 conditions per place. [2023-11-12 02:18:45,358 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 62 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2023-11-12 02:18:45,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 669 flow [2023-11-12 02:18:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:18:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:18:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-11-12 02:18:45,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46946564885496184 [2023-11-12 02:18:45,361 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-11-12 02:18:45,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-11-12 02:18:45,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:45,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-11-12 02:18:45,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:45,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:45,369 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:45,370 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 268 flow. Second operand 4 states and 492 transitions. [2023-11-12 02:18:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 669 flow [2023-11-12 02:18:45,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 605 flow, removed 26 selfloop flow, removed 1 redundant places. [2023-11-12 02:18:45,407 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 237 flow [2023-11-12 02:18:45,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-11-12 02:18:45,408 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-12 02:18:45,409 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 237 flow [2023-11-12 02:18:45,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:45,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:45,409 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-12 02:18:45,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:18:45,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:45,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash -946625897, now seen corresponding path program 1 times [2023-11-12 02:18:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:45,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253860440] [2023-11-12 02:18:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:45,730 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-12 02:18:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253860440] [2023-11-12 02:18:45,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253860440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:45,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:45,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075836209] [2023-11-12 02:18:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:45,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:18:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:18:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:18:45,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 262 [2023-11-12 02:18:45,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:45,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:45,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 262 [2023-11-12 02:18:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:46,110 INFO L124 PetriNetUnfolderBase]: 532/1033 cut-off events. [2023-11-12 02:18:46,110 INFO L125 PetriNetUnfolderBase]: For 1199/1202 co-relation queries the response was YES. [2023-11-12 02:18:46,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 1033 events. 532/1033 cut-off events. For 1199/1202 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5837 event pairs, 145 based on Foata normal form. 61/1064 useless extension candidates. Maximal degree in co-relation 3465. Up to 372 conditions per place. [2023-11-12 02:18:46,118 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 46 selfloop transitions, 11 changer transitions 12/77 dead transitions. [2023-11-12 02:18:46,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 542 flow [2023-11-12 02:18:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2023-11-12 02:18:46,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411123227917121 [2023-11-12 02:18:46,123 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 809 transitions. [2023-11-12 02:18:46,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 809 transitions. [2023-11-12 02:18:46,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:46,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 809 transitions. [2023-11-12 02:18:46,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:46,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:46,133 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:46,133 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 237 flow. Second operand 7 states and 809 transitions. [2023-11-12 02:18:46,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 542 flow [2023-11-12 02:18:46,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 512 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-12 02:18:46,141 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 260 flow [2023-11-12 02:18:46,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-11-12 02:18:46,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2023-11-12 02:18:46,144 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 260 flow [2023-11-12 02:18:46,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:46,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:46,146 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-12 02:18:46,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:18:46,146 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:46,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1870417263, now seen corresponding path program 1 times [2023-11-12 02:18:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:46,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909005204] [2023-11-12 02:18:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:46,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:47,020 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-12 02:18:47,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909005204] [2023-11-12 02:18:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909005204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:47,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359425858] [2023-11-12 02:18:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:47,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:18:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:18:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:18:47,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 262 [2023-11-12 02:18:47,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:47,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:18:47,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 262 [2023-11-12 02:18:47,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:18:47,580 INFO L124 PetriNetUnfolderBase]: 602/1203 cut-off events. [2023-11-12 02:18:47,581 INFO L125 PetriNetUnfolderBase]: For 2127/2132 co-relation queries the response was YES. [2023-11-12 02:18:47,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4599 conditions, 1203 events. 602/1203 cut-off events. For 2127/2132 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7295 event pairs, 65 based on Foata normal form. 3/1178 useless extension candidates. Maximal degree in co-relation 4580. Up to 579 conditions per place. [2023-11-12 02:18:47,591 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 69 selfloop transitions, 7 changer transitions 3/87 dead transitions. [2023-11-12 02:18:47,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 704 flow [2023-11-12 02:18:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:18:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-11-12 02:18:47,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45038167938931295 [2023-11-12 02:18:47,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-11-12 02:18:47,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-11-12 02:18:47,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:18:47,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-11-12 02:18:47,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:47,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:47,606 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:47,606 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 260 flow. Second operand 7 states and 826 transitions. [2023-11-12 02:18:47,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 704 flow [2023-11-12 02:18:47,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 592 flow, removed 26 selfloop flow, removed 8 redundant places. [2023-11-12 02:18:47,623 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 255 flow [2023-11-12 02:18:47,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-11-12 02:18:47,624 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-12 02:18:47,624 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 255 flow [2023-11-12 02:18:47,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:18:47,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:18:47,625 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-12 02:18:47,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:18:47,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:18:47,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1574880491, now seen corresponding path program 2 times [2023-11-12 02:18:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053550429] [2023-11-12 02:18:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:18:47,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:18:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:18:47,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:18:47,829 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:18:47,830 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-12 02:18:47,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-12 02:18:47,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-12 02:18:47,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-12 02:18:47,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-12 02:18:47,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-12 02:18:47,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-12 02:18:47,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-12 02:18:47,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-12 02:18:47,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-12 02:18:47,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-12 02:18:47,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-12 02:18:47,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-12 02:18:47,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:18:47,836 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:47,843 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:18:47,843 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:18:47,918 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:18:47,920 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:18:47,923 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:18:47,943 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:18:47,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:18:47 BasicIcfg [2023-11-12 02:18:47,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:18:47,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:18:47,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:18:47,967 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:18:47,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:31" (3/4) ... [2023-11-12 02:18:47,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:18:47,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:18:47,972 INFO L158 Benchmark]: Toolchain (without parser) took 18460.65ms. Allocated memory was 157.3MB in the beginning and 476.1MB in the end (delta: 318.8MB). Free memory was 127.0MB in the beginning and 234.2MB in the end (delta: -107.2MB). Peak memory consumption was 212.6MB. Max. memory is 16.1GB. [2023-11-12 02:18:47,972 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:18:47,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.62ms. Allocated memory is still 157.3MB. Free memory was 128.0MB in the beginning and 104.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:18:47,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.75ms. Allocated memory is still 157.3MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:18:47,973 INFO L158 Benchmark]: Boogie Preprocessor took 70.06ms. Allocated memory is still 157.3MB. Free memory was 102.3MB in the beginning and 100.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:18:47,974 INFO L158 Benchmark]: RCFGBuilder took 900.82ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 108.6MB in the end (delta: -8.6MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-11-12 02:18:47,974 INFO L158 Benchmark]: TraceAbstraction took 16683.42ms. Allocated memory was 157.3MB in the beginning and 476.1MB in the end (delta: 318.8MB). Free memory was 107.7MB in the beginning and 234.2MB in the end (delta: -126.5MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. [2023-11-12 02:18:47,974 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 476.1MB. Free memory is still 234.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:18:47,976 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.31ms. Allocated memory is still 121.6MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.62ms. Allocated memory is still 157.3MB. Free memory was 128.0MB in the beginning and 104.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.75ms. Allocated memory is still 157.3MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.06ms. Allocated memory is still 157.3MB. Free memory was 102.3MB in the beginning and 100.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 900.82ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 108.6MB in the end (delta: -8.6MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16683.42ms. Allocated memory was 157.3MB in the beginning and 476.1MB in the end (delta: 318.8MB). Free memory was 107.7MB in the beginning and 234.2MB in the end (delta: -126.5MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 476.1MB. Free memory is still 234.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 134 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 2764 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 132 TotalNumberOfCompositions, 7616 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3470, independent: 3264, independent conditional: 0, independent unconditional: 3264, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1513, independent: 1469, independent conditional: 0, independent unconditional: 1469, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3470, independent: 1795, independent conditional: 0, independent unconditional: 1795, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1513, unknown conditional: 0, unknown unconditional: 1513] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix038_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 848]: 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, 158 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: 16.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1313 IncrementalHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 60 mSDtfsCounter, 1313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=8, InterpolantAutomatonStates: 51, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-12 02:18:48,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl --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 cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:18:50,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:18:50,970 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:18:50,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:18:50,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:18:51,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:18:51,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:18:51,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:18:51,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:18:51,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:18:51,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:18:51,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:18:51,038 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:18:51,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:18:51,040 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:18:51,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:18:51,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:18:51,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:18:51,043 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:18:51,043 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:18:51,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:18:51,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:18:51,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:18:51,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:18:51,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:18:51,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:18:51,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:18:51,048 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:18:51,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:18:51,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:18:51,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:18:51,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:51,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:18:51,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:18:51,051 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:18:51,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:18:51,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:18:51,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:18:51,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:18:51,052 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:18:51,053 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:18:51,053 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_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/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_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl 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 -> cb908a7f9df60a2a419557a30ba61167baea262647e714e35178f644d31e1055 [2023-11-12 02:18:51,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:18:51,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:18:51,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:18:51,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:18:51,460 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:18:51,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:18:54,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:18:55,047 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:18:55,048 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/sv-benchmarks/c/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:18:55,066 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data/c85b67c7b/63487ae0a547400b983c3c9a3f73c890/FLAG8b4315b51 [2023-11-12 02:18:55,082 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/data/c85b67c7b/63487ae0a547400b983c3c9a3f73c890 [2023-11-12 02:18:55,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:18:55,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:18:55,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:55,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:18:55,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:18:55,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124bcd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55, skipping insertion in model container [2023-11-12 02:18:55,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,155 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:18:55,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:55,657 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:18:55,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:55,827 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:55,827 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:55,836 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:18:55,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55 WrapperNode [2023-11-12 02:18:55,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:55,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:55,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:18:55,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:18:55,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,925 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-12 02:18:55,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:55,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:18:55,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:18:55,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:18:55,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:55,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:18:55,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:18:55,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:18:55,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:18:56,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (1/1) ... [2023-11-12 02:18:56,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:18:56,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:18:56,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:18:56,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:18:56,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:18:56,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:18:56,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:18:56,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:18:56,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:18:56,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:18:56,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:18:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:18:56,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:18:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:18:56,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:18:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:18:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:18:56,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:18:56,097 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:18:56,337 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:18:56,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:18:56,842 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:18:57,040 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:18:57,040 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:18:57,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:57 BoogieIcfgContainer [2023-11-12 02:18:57,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:18:57,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:18:57,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:18:57,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:18:57,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:18:55" (1/3) ... [2023-11-12 02:18:57,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62210d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:57, skipping insertion in model container [2023-11-12 02:18:57,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:55" (2/3) ... [2023-11-12 02:18:57,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62210d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:57, skipping insertion in model container [2023-11-12 02:18:57,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:57" (3/3) ... [2023-11-12 02:18:57,053 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:18:57,073 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:18:57,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 02:18:57,074 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:18:57,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:18:57,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 274 flow [2023-11-12 02:18:57,309 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-12 02:18:57,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:57,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-12 02:18:57,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 131 transitions, 274 flow [2023-11-12 02:18:57,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 128 transitions, 265 flow [2023-11-12 02:18:57,339 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:18:57,351 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-12 02:18:57,360 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-12 02:18:57,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 128 transitions, 265 flow [2023-11-12 02:18:57,407 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-12 02:18:57,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:18:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-12 02:18:57,414 INFO L119 LiptonReduction]: Number of co-enabled transitions 2764 [2023-11-12 02:19:07,170 INFO L134 LiptonReduction]: Checked pairs total: 7033 [2023-11-12 02:19:07,170 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-11-12 02:19:07,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:19:07,191 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;@5e6de6b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:19:07,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 02:19:07,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:19:07,193 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:19:07,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:19:07,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:07,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:19:07,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:07,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 582, now seen corresponding path program 1 times [2023-11-12 02:19:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:07,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575459001] [2023-11-12 02:19:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:07,211 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-12 02:19:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:07,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:07,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:07,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:19:07,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:07,355 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-12 02:19:07,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:07,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575459001] [2023-11-12 02:19:07,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575459001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:07,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:07,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:19:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961063188] [2023-11-12 02:19:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:07,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:19:07,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:19:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:19:07,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 261 [2023-11-12 02:19:07,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:07,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:07,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 261 [2023-11-12 02:19:07,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:08,051 INFO L124 PetriNetUnfolderBase]: 1616/2387 cut-off events. [2023-11-12 02:19:08,051 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-12 02:19:08,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4811 conditions, 2387 events. 1616/2387 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11419 event pairs, 1616 based on Foata normal form. 0/2011 useless extension candidates. Maximal degree in co-relation 4800. Up to 2368 conditions per place. [2023-11-12 02:19:08,081 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-12 02:19:08,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-11-12 02:19:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:19:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:19:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 264 transitions. [2023-11-12 02:19:08,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2023-11-12 02:19:08,099 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 264 transitions. [2023-11-12 02:19:08,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 264 transitions. [2023-11-12 02:19:08,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:08,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 264 transitions. [2023-11-12 02:19:08,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:08,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:08,123 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:08,125 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 264 transitions. [2023-11-12 02:19:08,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-11-12 02:19:08,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:19:08,131 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-12 02:19:08,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-12 02:19:08,137 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-12 02:19:08,137 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-12 02:19:08,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:08,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:08,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-12 02:19:08,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:08,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:08,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:08,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 571830, now seen corresponding path program 1 times [2023-11-12 02:19:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207888033] [2023-11-12 02:19:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:08,352 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-12 02:19:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:08,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:08,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:19:08,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:08,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:08,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207888033] [2023-11-12 02:19:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207888033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:08,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:08,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:19:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761854454] [2023-11-12 02:19:08,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:08,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:08,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:08,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:08,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2023-11-12 02:19:08,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:08,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:08,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2023-11-12 02:19:08,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:09,001 INFO L124 PetriNetUnfolderBase]: 1263/2018 cut-off events. [2023-11-12 02:19:09,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:19:09,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2018 events. 1263/2018 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11256 event pairs, 204 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 3924. Up to 1510 conditions per place. [2023-11-12 02:19:09,020 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 35 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-12 02:19:09,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2023-11-12 02:19:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:19:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-12 02:19:09,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955300127713921 [2023-11-12 02:19:09,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-12 02:19:09,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-12 02:19:09,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:09,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-12 02:19:09,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,046 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 388 transitions. [2023-11-12 02:19:09,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2023-11-12 02:19:09,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:19:09,049 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-12 02:19:09,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-12 02:19:09,050 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-12 02:19:09,051 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-12 02:19:09,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:09,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:09,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:19:09,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:09,263 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:09,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1186537002, now seen corresponding path program 1 times [2023-11-12 02:19:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089212164] [2023-11-12 02:19:09,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:09,266 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-12 02:19:09,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:09,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:09,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-12 02:19:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:09,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:19:09,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:09,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:09,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:09,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089212164] [2023-11-12 02:19:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089212164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:19:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576133526] [2023-11-12 02:19:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:09,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:09,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 261 [2023-11-12 02:19:09,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:09,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 261 [2023-11-12 02:19:09,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:09,878 INFO L124 PetriNetUnfolderBase]: 679/1113 cut-off events. [2023-11-12 02:19:09,878 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-12 02:19:09,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 1113 events. 679/1113 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5321 event pairs, 130 based on Foata normal form. 80/1144 useless extension candidates. Maximal degree in co-relation 2346. Up to 752 conditions per place. [2023-11-12 02:19:09,888 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 31 selfloop transitions, 4 changer transitions 21/59 dead transitions. [2023-11-12 02:19:09,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 250 flow [2023-11-12 02:19:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:19:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:19:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-11-12 02:19:09,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697318007662835 [2023-11-12 02:19:09,892 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-11-12 02:19:09,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-11-12 02:19:09,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:09,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-11-12 02:19:09,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,930 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 613 transitions. [2023-11-12 02:19:09,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 250 flow [2023-11-12 02:19:09,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:19:09,934 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2023-11-12 02:19:09,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-12 02:19:09,936 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-12 02:19:09,936 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow [2023-11-12 02:19:09,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:09,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:09,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:09,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:19:10,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:10,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:10,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 580058585, now seen corresponding path program 1 times [2023-11-12 02:19:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931107525] [2023-11-12 02:19:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:10,150 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-12 02:19:10,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:10,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:10,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-12 02:19:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:10,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:19:10,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:10,347 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-12 02:19:10,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:10,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931107525] [2023-11-12 02:19:10,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931107525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:10,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:19:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886162213] [2023-11-12 02:19:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:10,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 261 [2023-11-12 02:19:10,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:10,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:10,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 261 [2023-11-12 02:19:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:10,723 INFO L124 PetriNetUnfolderBase]: 274/507 cut-off events. [2023-11-12 02:19:10,723 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2023-11-12 02:19:10,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 507 events. 274/507 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2193 event pairs, 73 based on Foata normal form. 44/535 useless extension candidates. Maximal degree in co-relation 1334. Up to 157 conditions per place. [2023-11-12 02:19:10,728 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 40 selfloop transitions, 7 changer transitions 21/71 dead transitions. [2023-11-12 02:19:10,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 358 flow [2023-11-12 02:19:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:19:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2023-11-12 02:19:10,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46998722860791825 [2023-11-12 02:19:10,733 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2023-11-12 02:19:10,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2023-11-12 02:19:10,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:10,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2023-11-12 02:19:10,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:10,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:10,756 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:10,756 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 6 states and 736 transitions. [2023-11-12 02:19:10,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 358 flow [2023-11-12 02:19:10,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 352 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-12 02:19:10,761 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow [2023-11-12 02:19:10,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-12 02:19:10,762 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-12 02:19:10,762 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow [2023-11-12 02:19:10,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:10,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:10,763 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-12 02:19:10,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:19:10,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:10,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:10,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1275025491, now seen corresponding path program 1 times [2023-11-12 02:19:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627217241] [2023-11-12 02:19:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:10,977 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-12 02:19:10,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:10,978 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:10,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-12 02:19:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:19:11,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:11,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-12 02:19:11,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:11,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:11,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627217241] [2023-11-12 02:19:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627217241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:11,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058507144] [2023-11-12 02:19:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:11,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:19:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:19:11,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:19:11,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 261 [2023-11-12 02:19:11,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:11,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:11,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 261 [2023-11-12 02:19:11,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:11,597 INFO L124 PetriNetUnfolderBase]: 168/318 cut-off events. [2023-11-12 02:19:11,597 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2023-11-12 02:19:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 318 events. 168/318 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1247 event pairs, 68 based on Foata normal form. 11/323 useless extension candidates. Maximal degree in co-relation 906. Up to 129 conditions per place. [2023-11-12 02:19:11,600 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 37 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2023-11-12 02:19:11,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 352 flow [2023-11-12 02:19:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:19:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:19:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-11-12 02:19:11,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458128078817734 [2023-11-12 02:19:11,605 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-11-12 02:19:11,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-11-12 02:19:11,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:11,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-11-12 02:19:11,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:11,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:11,615 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:11,615 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 837 transitions. [2023-11-12 02:19:11,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 352 flow [2023-11-12 02:19:11,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 316 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-12 02:19:11,622 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 142 flow [2023-11-12 02:19:11,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-12 02:19:11,623 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-12 02:19:11,624 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 142 flow [2023-11-12 02:19:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:11,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:11,625 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-12 02:19:11,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:19:11,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:11,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:11,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1481542153, now seen corresponding path program 1 times [2023-11-12 02:19:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446389480] [2023-11-12 02:19:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:11,844 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-12 02:19:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:11,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:11,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-12 02:19:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 02:19:12,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:12,451 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-12 02:19:12,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:12,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446389480] [2023-11-12 02:19:12,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446389480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:12,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:12,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:19:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027608141] [2023-11-12 02:19:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:19:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:19:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:19:12,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 261 [2023-11-12 02:19:12,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:12,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:12,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 261 [2023-11-12 02:19:12,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:13,011 INFO L124 PetriNetUnfolderBase]: 181/349 cut-off events. [2023-11-12 02:19:13,011 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2023-11-12 02:19:13,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 349 events. 181/349 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1371 event pairs, 22 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 1016. Up to 147 conditions per place. [2023-11-12 02:19:13,015 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 61 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-11-12 02:19:13,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 488 flow [2023-11-12 02:19:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:19:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:19:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 926 transitions. [2023-11-12 02:19:13,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434865900383142 [2023-11-12 02:19:13,020 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 926 transitions. [2023-11-12 02:19:13,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 926 transitions. [2023-11-12 02:19:13,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:13,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 926 transitions. [2023-11-12 02:19:13,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:13,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:13,031 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:13,031 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 142 flow. Second operand 8 states and 926 transitions. [2023-11-12 02:19:13,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 488 flow [2023-11-12 02:19:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 402 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-12 02:19:13,036 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 144 flow [2023-11-12 02:19:13,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-11-12 02:19:13,037 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-11-12 02:19:13,038 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 144 flow [2023-11-12 02:19:13,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:13,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:13,039 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-12 02:19:13,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-12 02:19:13,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:13,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:19:13,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:13,253 INFO L85 PathProgramCache]: Analyzing trace with hash 842345727, now seen corresponding path program 2 times [2023-11-12 02:19:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:19:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347715109] [2023-11-12 02:19:13,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:19:13,254 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-12 02:19:13,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:19:13,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -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-12 02:19:13,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_233a66b9-da7e-4195-b087-9bfdc64145aa/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-12 02:19:13,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-12 02:19:13,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:19:13,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:19:13,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:13,453 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-12 02:19:13,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:19:13,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:19:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347715109] [2023-11-12 02:19:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347715109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:13,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:19:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111393873] [2023-11-12 02:19:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:13,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:19:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:13,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2023-11-12 02:19:13,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:19:13,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:13,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2023-11-12 02:19:13,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand