./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:35:06,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:35:06,172 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:35:06,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:35:06,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:35:06,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:35:06,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:35:06,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:35:06,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:35:06,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:35:06,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:35:06,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:35:06,237 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:35:06,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:35:06,239 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:35:06,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:35:06,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:35:06,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:35:06,241 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:35:06,241 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:35:06,242 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:35:06,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:35:06,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:35:06,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:35:06,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:35:06,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:35:06,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:35:06,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:35:06,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:35:06,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:06,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:35:06,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:35:06,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:35:06,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:35:06,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:35:06,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:35:06,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:35:06,249 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:35:06,249 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_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/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_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2023-11-19 07:35:06,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:35:06,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:35:06,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:35:06,597 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:35:06,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:35:06,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:35:09,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:35:10,000 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:35:10,001 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:35:10,030 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data/8c4267fc0/6326944f09564f3ab351cb0d3842c862/FLAG6c1fa1f79 [2023-11-19 07:35:10,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data/8c4267fc0/6326944f09564f3ab351cb0d3842c862 [2023-11-19 07:35:10,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:35:10,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:35:10,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:10,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:35:10,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:35:10,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311ebaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10, skipping insertion in model container [2023-11-19 07:35:10,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,116 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:35:10,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:10,686 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:35:10,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:10,837 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:35:10,837 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:35:10,846 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:35:10,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10 WrapperNode [2023-11-19 07:35:10,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:10,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:10,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:35:10,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:35:10,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,941 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-19 07:35:10,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:10,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:35:10,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:35:10,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:35:10,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:10,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:11,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:11,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:11,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:11,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:11,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:35:11,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:35:11,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:35:11,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:35:11,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (1/1) ... [2023-11-19 07:35:11,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:11,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:11,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:35:11,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:35:11,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:35:11,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:35:11,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:35:11,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:35:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:35:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:35:11,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:35:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:35:11,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:35:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:35:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:35:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:35:11,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:35:11,141 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:35:11,347 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:35:11,350 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:35:11,728 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:35:11,895 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:35:11,895 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:35:11,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:11 BoogieIcfgContainer [2023-11-19 07:35:11,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:35:11,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:35:11,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:35:11,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:35:11,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:10" (1/3) ... [2023-11-19 07:35:11,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774308de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:11, skipping insertion in model container [2023-11-19 07:35:11,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:10" (2/3) ... [2023-11-19 07:35:11,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774308de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:11, skipping insertion in model container [2023-11-19 07:35:11,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:11" (3/3) ... [2023-11-19 07:35:11,911 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:35:11,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:35:11,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 07:35:11,933 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:35:11,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:35:12,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 103 transitions, 214 flow [2023-11-19 07:35:12,094 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-11-19 07:35:12,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:12,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 4/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:35:12,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 103 transitions, 214 flow [2023-11-19 07:35:12,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 101 transitions, 208 flow [2023-11-19 07:35:12,110 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:35:12,140 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 101 transitions, 208 flow [2023-11-19 07:35:12,145 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 101 transitions, 208 flow [2023-11-19 07:35:12,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 208 flow [2023-11-19 07:35:12,186 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-11-19 07:35:12,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:12,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 4/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:35:12,190 INFO L119 LiptonReduction]: Number of co-enabled transitions 1536 [2023-11-19 07:35:18,447 INFO L134 LiptonReduction]: Checked pairs total: 3405 [2023-11-19 07:35:18,447 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-11-19 07:35:18,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:35:18,472 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;@34922976, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:35:18,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:35:18,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:35:18,474 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:35:18,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:18,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:18,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:35:18,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:18,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 487, now seen corresponding path program 1 times [2023-11-19 07:35:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129374178] [2023-11-19 07:35:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:18,617 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-19 07:35:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129374178] [2023-11-19 07:35:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129374178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:18,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:18,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:35:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73636408] [2023-11-19 07:35:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:18,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:35:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:35:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:35:18,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 214 [2023-11-19 07:35:18,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:18,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:18,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 214 [2023-11-19 07:35:18,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:18,825 INFO L124 PetriNetUnfolderBase]: 175/312 cut-off events. [2023-11-19 07:35:18,825 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-19 07:35:18,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 312 events. 175/312 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1246 event pairs, 175 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 624. Up to 307 conditions per place. [2023-11-19 07:35:18,830 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-19 07:35:18,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-11-19 07:35:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:35:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:35:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-11-19 07:35:18,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672897196261682 [2023-11-19 07:35:18,873 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-11-19 07:35:18,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-11-19 07:35:18,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:18,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-11-19 07:35:18,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:18,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:18,890 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:18,892 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 200 transitions. [2023-11-19 07:35:18,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-11-19 07:35:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:35:18,898 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-19 07:35:18,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:35:18,905 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:35:18,906 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-19 07:35:18,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:18,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:18,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:35:18,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:35:18,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:18,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 480165, now seen corresponding path program 1 times [2023-11-19 07:35:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139883322] [2023-11-19 07:35:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:19,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-19 07:35:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139883322] [2023-11-19 07:35:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139883322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:19,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:35:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251145540] [2023-11-19 07:35:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:19,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:19,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:19,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:19,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2023-11-19 07:35:19,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:19,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:19,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2023-11-19 07:35:19,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:19,467 INFO L124 PetriNetUnfolderBase]: 135/255 cut-off events. [2023-11-19 07:35:19,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:19,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 255 events. 135/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1015 event pairs, 39 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 505. Up to 199 conditions per place. [2023-11-19 07:35:19,473 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-11-19 07:35:19,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 110 flow [2023-11-19 07:35:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:35:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-11-19 07:35:19,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45638629283489096 [2023-11-19 07:35:19,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-11-19 07:35:19,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-11-19 07:35:19,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:19,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-11-19 07:35:19,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:19,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:19,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:19,493 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 293 transitions. [2023-11-19 07:35:19,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 110 flow [2023-11-19 07:35:19,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:35:19,495 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:35:19,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:35:19,496 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:35:19,497 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:35:19,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:19,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:19,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:19,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:35:19,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:19,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1121463426, now seen corresponding path program 1 times [2023-11-19 07:35:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494800414] [2023-11-19 07:35:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:19,928 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-19 07:35:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494800414] [2023-11-19 07:35:19,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494800414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:35:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138585454] [2023-11-19 07:35:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:20,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 214 [2023-11-19 07:35:20,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:20,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 214 [2023-11-19 07:35:20,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:20,145 INFO L124 PetriNetUnfolderBase]: 87/165 cut-off events. [2023-11-19 07:35:20,145 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-19 07:35:20,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 165 events. 87/165 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 590 event pairs, 36 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 354. Up to 155 conditions per place. [2023-11-19 07:35:20,150 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2023-11-19 07:35:20,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 78 flow [2023-11-19 07:35:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:35:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:35:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-11-19 07:35:20,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38434579439252337 [2023-11-19 07:35:20,153 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-11-19 07:35:20,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-11-19 07:35:20,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:20,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-11-19 07:35:20,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,161 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 4 states and 329 transitions. [2023-11-19 07:35:20,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 78 flow [2023-11-19 07:35:20,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:35:20,163 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-11-19 07:35:20,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-11-19 07:35:20,165 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:35:20,165 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-11-19 07:35:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:20,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:20,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:35:20,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:20,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1121463411, now seen corresponding path program 1 times [2023-11-19 07:35:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273849016] [2023-11-19 07:35:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:20,496 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-19 07:35:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273849016] [2023-11-19 07:35:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273849016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:20,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:35:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948077564] [2023-11-19 07:35:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:20,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:20,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-11-19 07:35:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:20,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-11-19 07:35:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:20,586 INFO L124 PetriNetUnfolderBase]: 109/213 cut-off events. [2023-11-19 07:35:20,586 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-19 07:35:20,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 213 events. 109/213 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 748 event pairs, 43 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 429. Up to 184 conditions per place. [2023-11-19 07:35:20,589 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2023-11-19 07:35:20,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 98 flow [2023-11-19 07:35:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:35:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-11-19 07:35:20,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440809968847352 [2023-11-19 07:35:20,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-11-19 07:35:20,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-11-19 07:35:20,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:20,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-11-19 07:35:20,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,597 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 3 states and 283 transitions. [2023-11-19 07:35:20,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 98 flow [2023-11-19 07:35:20,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:35:20,599 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 54 flow [2023-11-19 07:35:20,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-19 07:35:20,601 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:35:20,601 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 54 flow [2023-11-19 07:35:20,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:20,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:20,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:20,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:35:20,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:20,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 405626082, now seen corresponding path program 1 times [2023-11-19 07:35:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:20,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073234313] [2023-11-19 07:35:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:21,074 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-19 07:35:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:21,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073234313] [2023-11-19 07:35:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073234313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:35:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544768242] [2023-11-19 07:35:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:21,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:21,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:21,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2023-11-19 07:35:21,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:21,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2023-11-19 07:35:21,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:21,190 INFO L124 PetriNetUnfolderBase]: 125/233 cut-off events. [2023-11-19 07:35:21,190 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-19 07:35:21,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 233 events. 125/233 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 779 event pairs, 53 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 532. Up to 211 conditions per place. [2023-11-19 07:35:21,193 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 19 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-19 07:35:21,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 118 flow [2023-11-19 07:35:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:35:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-11-19 07:35:21,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4501557632398754 [2023-11-19 07:35:21,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-11-19 07:35:21,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-11-19 07:35:21,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:21,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-11-19 07:35:21,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,201 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 54 flow. Second operand 3 states and 289 transitions. [2023-11-19 07:35:21,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 118 flow [2023-11-19 07:35:21,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:21,203 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 70 flow [2023-11-19 07:35:21,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-19 07:35:21,209 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2023-11-19 07:35:21,210 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 70 flow [2023-11-19 07:35:21,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:21,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:21,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:35:21,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:21,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -310491537, now seen corresponding path program 1 times [2023-11-19 07:35:21,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:21,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354516094] [2023-11-19 07:35:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:21,408 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-19 07:35:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354516094] [2023-11-19 07:35:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354516094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:35:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983326960] [2023-11-19 07:35:21,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:21,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:21,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-11-19 07:35:21,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:21,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-11-19 07:35:21,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:21,566 INFO L124 PetriNetUnfolderBase]: 145/282 cut-off events. [2023-11-19 07:35:21,566 INFO L125 PetriNetUnfolderBase]: For 119/125 co-relation queries the response was YES. [2023-11-19 07:35:21,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 282 events. 145/282 cut-off events. For 119/125 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1197 event pairs, 51 based on Foata normal form. 16/289 useless extension candidates. Maximal degree in co-relation 686. Up to 161 conditions per place. [2023-11-19 07:35:21,568 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-19 07:35:21,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 139 flow [2023-11-19 07:35:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:35:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-11-19 07:35:21,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4439252336448598 [2023-11-19 07:35:21,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-11-19 07:35:21,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-11-19 07:35:21,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:21,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-11-19 07:35:21,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,576 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 70 flow. Second operand 3 states and 285 transitions. [2023-11-19 07:35:21,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 139 flow [2023-11-19 07:35:21,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:21,579 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 78 flow [2023-11-19 07:35:21,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-11-19 07:35:21,580 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-19 07:35:21,580 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 78 flow [2023-11-19 07:35:21,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:21,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:21,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:21,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:35:21,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:21,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1613410690, now seen corresponding path program 1 times [2023-11-19 07:35:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705228415] [2023-11-19 07:35:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:22,297 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-19 07:35:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705228415] [2023-11-19 07:35:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705228415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:22,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688838451] [2023-11-19 07:35:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:22,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:35:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:22,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:35:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:22,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-11-19 07:35:22,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:22,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-11-19 07:35:22,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:22,452 INFO L124 PetriNetUnfolderBase]: 148/282 cut-off events. [2023-11-19 07:35:22,453 INFO L125 PetriNetUnfolderBase]: For 162/166 co-relation queries the response was YES. [2023-11-19 07:35:22,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 282 events. 148/282 cut-off events. For 162/166 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1085 event pairs, 51 based on Foata normal form. 3/283 useless extension candidates. Maximal degree in co-relation 713. Up to 244 conditions per place. [2023-11-19 07:35:22,455 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 20 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-11-19 07:35:22,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 150 flow [2023-11-19 07:35:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:35:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-11-19 07:35:22,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423676012461059 [2023-11-19 07:35:22,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-11-19 07:35:22,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-11-19 07:35:22,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:22,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-11-19 07:35:22,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,467 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 78 flow. Second operand 3 states and 284 transitions. [2023-11-19 07:35:22,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 150 flow [2023-11-19 07:35:22,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 142 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:22,470 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 97 flow [2023-11-19 07:35:22,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:35:22,471 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-11-19 07:35:22,472 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 97 flow [2023-11-19 07:35:22,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:22,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:22,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:35:22,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:22,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -311937625, now seen corresponding path program 1 times [2023-11-19 07:35:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801968349] [2023-11-19 07:35:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:22,810 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-19 07:35:22,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801968349] [2023-11-19 07:35:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801968349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:22,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:35:22,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723599068] [2023-11-19 07:35:22,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:22,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:22,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-11-19 07:35:22,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:22,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-11-19 07:35:22,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:22,949 INFO L124 PetriNetUnfolderBase]: 149/289 cut-off events. [2023-11-19 07:35:22,949 INFO L125 PetriNetUnfolderBase]: For 228/231 co-relation queries the response was YES. [2023-11-19 07:35:22,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 289 events. 149/289 cut-off events. For 228/231 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1134 event pairs, 49 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 811. Up to 247 conditions per place. [2023-11-19 07:35:22,952 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 24 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2023-11-19 07:35:22,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 198 flow [2023-11-19 07:35:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:35:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:35:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2023-11-19 07:35:22,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392523364485981 [2023-11-19 07:35:22,955 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2023-11-19 07:35:22,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2023-11-19 07:35:22,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:22,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2023-11-19 07:35:22,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,960 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,960 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 97 flow. Second operand 4 states and 376 transitions. [2023-11-19 07:35:22,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 198 flow [2023-11-19 07:35:22,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:22,966 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 125 flow [2023-11-19 07:35:22,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-11-19 07:35:22,969 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-11-19 07:35:22,969 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 125 flow [2023-11-19 07:35:22,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:22,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:22,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:22,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:35:22,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:22,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash -312028765, now seen corresponding path program 2 times [2023-11-19 07:35:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477592029] [2023-11-19 07:35:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:24,068 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-19 07:35:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477592029] [2023-11-19 07:35:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477592029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450038508] [2023-11-19 07:35:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:24,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:35:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:35:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:24,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 214 [2023-11-19 07:35:24,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:24,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:24,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 214 [2023-11-19 07:35:24,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:24,374 INFO L124 PetriNetUnfolderBase]: 181/340 cut-off events. [2023-11-19 07:35:24,374 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2023-11-19 07:35:24,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 340 events. 181/340 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1330 event pairs, 41 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1059. Up to 277 conditions per place. [2023-11-19 07:35:24,378 INFO L140 encePairwiseOnDemand]: 205/214 looper letters, 29 selfloop transitions, 17 changer transitions 1/47 dead transitions. [2023-11-19 07:35:24,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 311 flow [2023-11-19 07:35:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:35:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2023-11-19 07:35:24,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40965732087227413 [2023-11-19 07:35:24,382 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2023-11-19 07:35:24,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2023-11-19 07:35:24,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:24,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2023-11-19 07:35:24,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:24,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:24,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:24,388 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 125 flow. Second operand 6 states and 526 transitions. [2023-11-19 07:35:24,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 311 flow [2023-11-19 07:35:24,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 303 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:24,394 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 220 flow [2023-11-19 07:35:24,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-19 07:35:24,395 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-11-19 07:35:24,395 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 220 flow [2023-11-19 07:35:24,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:24,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:24,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:24,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:35:24,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:24,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1035252979, now seen corresponding path program 1 times [2023-11-19 07:35:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147568531] [2023-11-19 07:35:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:25,514 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-19 07:35:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:25,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147568531] [2023-11-19 07:35:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147568531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:35:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30484011] [2023-11-19 07:35:25,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:25,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:35:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:25,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:35:25,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:35:25,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2023-11-19 07:35:25,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:25,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:25,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2023-11-19 07:35:25,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:25,885 INFO L124 PetriNetUnfolderBase]: 201/379 cut-off events. [2023-11-19 07:35:25,886 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2023-11-19 07:35:25,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 379 events. 201/379 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1577 event pairs, 37 based on Foata normal form. 4/383 useless extension candidates. Maximal degree in co-relation 1407. Up to 257 conditions per place. [2023-11-19 07:35:25,890 INFO L140 encePairwiseOnDemand]: 205/214 looper letters, 33 selfloop transitions, 22 changer transitions 2/57 dead transitions. [2023-11-19 07:35:25,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 461 flow [2023-11-19 07:35:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:35:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2023-11-19 07:35:25,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40498442367601245 [2023-11-19 07:35:25,894 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 520 transitions. [2023-11-19 07:35:25,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 520 transitions. [2023-11-19 07:35:25,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:25,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 520 transitions. [2023-11-19 07:35:25,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:25,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:25,900 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:25,900 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 220 flow. Second operand 6 states and 520 transitions. [2023-11-19 07:35:25,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 461 flow [2023-11-19 07:35:25,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 455 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 07:35:25,906 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 372 flow [2023-11-19 07:35:25,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-19 07:35:25,908 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2023-11-19 07:35:25,908 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 372 flow [2023-11-19 07:35:25,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:25,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:25,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:25,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:35:25,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:25,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050081, now seen corresponding path program 1 times [2023-11-19 07:35:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005268904] [2023-11-19 07:35:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:25,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:26,596 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-19 07:35:26,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005268904] [2023-11-19 07:35:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005268904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:26,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:35:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674043755] [2023-11-19 07:35:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:26,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:35:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:35:26,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:35:26,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 214 [2023-11-19 07:35:26,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:26,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:26,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 214 [2023-11-19 07:35:26,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:26,854 INFO L124 PetriNetUnfolderBase]: 180/353 cut-off events. [2023-11-19 07:35:26,854 INFO L125 PetriNetUnfolderBase]: For 1229/1236 co-relation queries the response was YES. [2023-11-19 07:35:26,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 353 events. 180/353 cut-off events. For 1229/1236 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1481 event pairs, 68 based on Foata normal form. 8/361 useless extension candidates. Maximal degree in co-relation 1599. Up to 309 conditions per place. [2023-11-19 07:35:26,860 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 39 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2023-11-19 07:35:26,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 519 flow [2023-11-19 07:35:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:35:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:35:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2023-11-19 07:35:26,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158878504672897 [2023-11-19 07:35:26,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 445 transitions. [2023-11-19 07:35:26,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 445 transitions. [2023-11-19 07:35:26,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:26,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 445 transitions. [2023-11-19 07:35:26,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:26,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:26,868 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:26,869 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 372 flow. Second operand 5 states and 445 transitions. [2023-11-19 07:35:26,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 519 flow [2023-11-19 07:35:26,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 512 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:26,875 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 410 flow [2023-11-19 07:35:26,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-19 07:35:26,876 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2023-11-19 07:35:26,876 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 410 flow [2023-11-19 07:35:26,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:26,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:26,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:26,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:35:26,879 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:26,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1083000109, now seen corresponding path program 2 times [2023-11-19 07:35:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509792470] [2023-11-19 07:35:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:27,907 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-19 07:35:27,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:27,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509792470] [2023-11-19 07:35:27,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509792470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:27,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:35:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897915049] [2023-11-19 07:35:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:35:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:35:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:35:27,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 214 [2023-11-19 07:35:27,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:27,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:27,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 214 [2023-11-19 07:35:27,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:28,199 INFO L124 PetriNetUnfolderBase]: 196/380 cut-off events. [2023-11-19 07:35:28,199 INFO L125 PetriNetUnfolderBase]: For 1522/1522 co-relation queries the response was YES. [2023-11-19 07:35:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 380 events. 196/380 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1593 event pairs, 60 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 1826. Up to 292 conditions per place. [2023-11-19 07:35:28,204 INFO L140 encePairwiseOnDemand]: 205/214 looper letters, 36 selfloop transitions, 23 changer transitions 6/65 dead transitions. [2023-11-19 07:35:28,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 688 flow [2023-11-19 07:35:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:35:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2023-11-19 07:35:28,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39797507788161995 [2023-11-19 07:35:28,208 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2023-11-19 07:35:28,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2023-11-19 07:35:28,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:28,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2023-11-19 07:35:28,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,216 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,216 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 410 flow. Second operand 6 states and 511 transitions. [2023-11-19 07:35:28,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 688 flow [2023-11-19 07:35:28,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 664 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-19 07:35:28,228 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 560 flow [2023-11-19 07:35:28,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-11-19 07:35:28,229 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2023-11-19 07:35:28,230 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 560 flow [2023-11-19 07:35:28,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:28,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:28,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:35:28,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:28,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1082958259, now seen corresponding path program 3 times [2023-11-19 07:35:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146650222] [2023-11-19 07:35:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:28,675 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-19 07:35:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:28,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146650222] [2023-11-19 07:35:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146650222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:28,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:35:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68421389] [2023-11-19 07:35:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:28,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:35:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:35:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:35:28,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-11-19 07:35:28,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 560 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:28,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-11-19 07:35:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:28,859 INFO L124 PetriNetUnfolderBase]: 160/323 cut-off events. [2023-11-19 07:35:28,859 INFO L125 PetriNetUnfolderBase]: For 1825/1833 co-relation queries the response was YES. [2023-11-19 07:35:28,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 323 events. 160/323 cut-off events. For 1825/1833 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1345 event pairs, 61 based on Foata normal form. 8/331 useless extension candidates. Maximal degree in co-relation 1808. Up to 276 conditions per place. [2023-11-19 07:35:28,864 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 41 selfloop transitions, 13 changer transitions 2/60 dead transitions. [2023-11-19 07:35:28,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 734 flow [2023-11-19 07:35:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:35:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:35:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2023-11-19 07:35:28,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43457943925233644 [2023-11-19 07:35:28,867 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2023-11-19 07:35:28,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2023-11-19 07:35:28,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:28,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2023-11-19 07:35:28,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 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-19 07:35:28,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,872 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 560 flow. Second operand 5 states and 465 transitions. [2023-11-19 07:35:28,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 734 flow [2023-11-19 07:35:28,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 711 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-11-19 07:35:28,884 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 570 flow [2023-11-19 07:35:28,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=570, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-19 07:35:28,885 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2023-11-19 07:35:28,885 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 570 flow [2023-11-19 07:35:28,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:28,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:28,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:35:28,886 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:28,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 921610637, now seen corresponding path program 1 times [2023-11-19 07:35:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358307153] [2023-11-19 07:35:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:29,050 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-19 07:35:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358307153] [2023-11-19 07:35:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358307153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545734878] [2023-11-19 07:35:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:29,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:29,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 214 [2023-11-19 07:35:29,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:29,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 214 [2023-11-19 07:35:29,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:29,186 INFO L124 PetriNetUnfolderBase]: 82/200 cut-off events. [2023-11-19 07:35:29,186 INFO L125 PetriNetUnfolderBase]: For 1689/1726 co-relation queries the response was YES. [2023-11-19 07:35:29,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 200 events. 82/200 cut-off events. For 1689/1726 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 883 event pairs, 9 based on Foata normal form. 65/264 useless extension candidates. Maximal degree in co-relation 1089. Up to 95 conditions per place. [2023-11-19 07:35:29,188 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 34 selfloop transitions, 4 changer transitions 32/75 dead transitions. [2023-11-19 07:35:29,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 932 flow [2023-11-19 07:35:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:35:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:35:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-11-19 07:35:29,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4308411214953271 [2023-11-19 07:35:29,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-11-19 07:35:29,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-11-19 07:35:29,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:29,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-11-19 07:35:29,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,197 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 570 flow. Second operand 5 states and 461 transitions. [2023-11-19 07:35:29,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 932 flow [2023-11-19 07:35:29,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 775 flow, removed 15 selfloop flow, removed 14 redundant places. [2023-11-19 07:35:29,206 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 346 flow [2023-11-19 07:35:29,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2023-11-19 07:35:29,207 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2023-11-19 07:35:29,208 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 346 flow [2023-11-19 07:35:29,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:29,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:29,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:35:29,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:29,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 990622029, now seen corresponding path program 1 times [2023-11-19 07:35:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840449803] [2023-11-19 07:35:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:29,367 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-19 07:35:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840449803] [2023-11-19 07:35:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840449803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:35:29,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675277343] [2023-11-19 07:35:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:29,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:35:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:29,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:35:29,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:29,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 214 [2023-11-19 07:35:29,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:29,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 214 [2023-11-19 07:35:29,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:29,489 INFO L124 PetriNetUnfolderBase]: 31/95 cut-off events. [2023-11-19 07:35:29,490 INFO L125 PetriNetUnfolderBase]: For 543/550 co-relation queries the response was YES. [2023-11-19 07:35:29,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 95 events. 31/95 cut-off events. For 543/550 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 316 event pairs, 4 based on Foata normal form. 21/115 useless extension candidates. Maximal degree in co-relation 500. Up to 35 conditions per place. [2023-11-19 07:35:29,518 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 21 selfloop transitions, 5 changer transitions 22/51 dead transitions. [2023-11-19 07:35:29,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 552 flow [2023-11-19 07:35:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:35:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-11-19 07:35:29,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205607476635514 [2023-11-19 07:35:29,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-11-19 07:35:29,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-11-19 07:35:29,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:29,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-11-19 07:35:29,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,529 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,529 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 346 flow. Second operand 6 states and 540 transitions. [2023-11-19 07:35:29,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 552 flow [2023-11-19 07:35:29,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 497 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-19 07:35:29,535 INFO L231 Difference]: Finished difference. Result has 59 places, 23 transitions, 195 flow [2023-11-19 07:35:29,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=59, PETRI_TRANSITIONS=23} [2023-11-19 07:35:29,537 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2023-11-19 07:35:29,537 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 23 transitions, 195 flow [2023-11-19 07:35:29,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:29,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:29,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:29,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:35:29,538 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:29,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 544771675, now seen corresponding path program 1 times [2023-11-19 07:35:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401281241] [2023-11-19 07:35:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:30,412 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-19 07:35:30,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401281241] [2023-11-19 07:35:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401281241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:30,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:35:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393781886] [2023-11-19 07:35:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:30,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:35:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:30,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:35:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:35:30,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 214 [2023-11-19 07:35:30,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 23 transitions, 195 flow. Second operand has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:30,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:30,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 214 [2023-11-19 07:35:30,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:30,671 INFO L124 PetriNetUnfolderBase]: 15/54 cut-off events. [2023-11-19 07:35:30,671 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-19 07:35:30,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 54 events. 15/54 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 1 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 277. Up to 27 conditions per place. [2023-11-19 07:35:30,673 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 17 selfloop transitions, 4 changer transitions 14/36 dead transitions. [2023-11-19 07:35:30,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 36 transitions, 359 flow [2023-11-19 07:35:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:35:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:35:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 617 transitions. [2023-11-19 07:35:30,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41188251001335113 [2023-11-19 07:35:30,677 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 617 transitions. [2023-11-19 07:35:30,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 617 transitions. [2023-11-19 07:35:30,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:30,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 617 transitions. [2023-11-19 07:35:30,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:30,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:30,685 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:30,685 INFO L175 Difference]: Start difference. First operand has 59 places, 23 transitions, 195 flow. Second operand 7 states and 617 transitions. [2023-11-19 07:35:30,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 36 transitions, 359 flow [2023-11-19 07:35:30,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 243 flow, removed 29 selfloop flow, removed 19 redundant places. [2023-11-19 07:35:30,688 INFO L231 Difference]: Finished difference. Result has 41 places, 19 transitions, 99 flow [2023-11-19 07:35:30,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=19} [2023-11-19 07:35:30,689 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-11-19 07:35:30,689 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 19 transitions, 99 flow [2023-11-19 07:35:30,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:30,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:30,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:35:30,691 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:30,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1440628407, now seen corresponding path program 2 times [2023-11-19 07:35:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602448087] [2023-11-19 07:35:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:30,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:30,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:30,852 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:35:30,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 07:35:30,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 07:35:30,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 07:35:30,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 07:35:30,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 07:35:30,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 07:35:30,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 07:35:30,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 07:35:30,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 07:35:30,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 07:35:30,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:35:30,859 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:30,866 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:35:30,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:35:30,924 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:35:30,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:35:30,935 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:35:30,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:35:30 BasicIcfg [2023-11-19 07:35:30,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:35:30,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:35:30,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:35:30,949 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:35:30,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:11" (3/4) ... [2023-11-19 07:35:30,951 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:35:30,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:35:30,953 INFO L158 Benchmark]: Toolchain (without parser) took 20903.16ms. Allocated memory was 136.3MB in the beginning and 371.2MB in the end (delta: 234.9MB). Free memory was 86.6MB in the beginning and 284.6MB in the end (delta: -198.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2023-11-19 07:35:30,954 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:35:30,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.83ms. Allocated memory is still 136.3MB. Free memory was 86.6MB in the beginning and 63.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:30,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.66ms. Allocated memory is still 136.3MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:30,955 INFO L158 Benchmark]: Boogie Preprocessor took 118.85ms. Allocated memory is still 136.3MB. Free memory was 61.1MB in the beginning and 106.0MB in the end (delta: -44.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2023-11-19 07:35:30,955 INFO L158 Benchmark]: RCFGBuilder took 835.27ms. Allocated memory is still 136.3MB. Free memory was 106.0MB in the beginning and 72.7MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-19 07:35:30,956 INFO L158 Benchmark]: TraceAbstraction took 19045.98ms. Allocated memory was 136.3MB in the beginning and 371.2MB in the end (delta: 234.9MB). Free memory was 71.7MB in the beginning and 285.7MB in the end (delta: -213.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-11-19 07:35:30,956 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 371.2MB. Free memory was 285.7MB in the beginning and 284.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:35:30,958 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.27ms. Allocated memory is still 109.1MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.83ms. Allocated memory is still 136.3MB. Free memory was 86.6MB in the beginning and 63.8MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.66ms. Allocated memory is still 136.3MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.85ms. Allocated memory is still 136.3MB. Free memory was 61.1MB in the beginning and 106.0MB in the end (delta: -44.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * RCFGBuilder took 835.27ms. Allocated memory is still 136.3MB. Free memory was 106.0MB in the beginning and 72.7MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19045.98ms. Allocated memory was 136.3MB in the beginning and 371.2MB in the end (delta: 234.9MB). Free memory was 71.7MB in the beginning and 285.7MB in the end (delta: -213.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 371.2MB. Free memory was 285.7MB in the beginning and 284.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 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: 6.3s, 104 PlacesBefore, 29 PlacesAfterwards, 101 TransitionsBefore, 22 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 111 TotalNumberOfCompositions, 3405 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1659, independent: 1539, independent conditional: 0, independent unconditional: 1539, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 802, independent: 769, independent conditional: 0, independent unconditional: 769, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1659, independent: 770, independent conditional: 0, independent unconditional: 770, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 802, unknown conditional: 0, unknown unconditional: 802] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 119 locations, 10 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: 18.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1111 IncrementalHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 93 mSDtfsCounter, 1111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=13, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:35:31,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/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_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:35:34,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:35:34,153 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:35:34,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:35:34,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:35:34,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:35:34,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:35:34,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:35:34,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:35:34,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:35:34,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:35:34,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:35:34,219 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:35:34,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:35:34,221 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:35:34,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:35:34,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:35:34,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:35:34,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:35:34,224 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:35:34,225 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:35:34,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:35:34,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:35:34,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:35:34,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:35:34,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:35:34,227 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:35:34,228 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:35:34,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:35:34,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:35:34,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:35:34,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:34,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:35:34,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:35:34,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:35:34,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:35:34,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:35:34,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:35:34,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:35:34,234 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:35:34,234 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:35:34,235 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_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/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_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2023-11-19 07:35:34,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:35:34,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:35:34,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:35:34,675 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:35:34,676 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:35:34,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:35:37,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:35:38,338 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:35:38,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:35:38,367 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data/791f71a09/205de7dc12e1451997c187005e1ce962/FLAG71d82867d [2023-11-19 07:35:38,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/data/791f71a09/205de7dc12e1451997c187005e1ce962 [2023-11-19 07:35:38,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:35:38,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:35:38,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:38,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:35:38,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:35:38,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:38" (1/1) ... [2023-11-19 07:35:38,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543a97e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:38, skipping insertion in model container [2023-11-19 07:35:38,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:38" (1/1) ... [2023-11-19 07:35:38,475 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:35:38,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:38,880 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:35:38,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:39,001 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:35:39,001 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:35:39,010 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:35:39,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39 WrapperNode [2023-11-19 07:35:39,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:39,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:39,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:35:39,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:35:39,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,117 INFO L138 Inliner]: procedures = 178, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-19 07:35:39,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:39,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:35:39,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:35:39,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:35:39,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:35:39,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:35:39,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:35:39,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:35:39,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (1/1) ... [2023-11-19 07:35:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:39,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:39,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:35:39,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:35:39,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:35:39,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:35:39,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:35:39,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:35:39,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:35:39,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:35:39,308 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:35:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:35:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:35:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:35:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:35:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:35:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:35:39,313 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:35:39,507 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:35:39,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:35:39,946 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:35:40,213 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:35:40,214 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:35:40,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:40 BoogieIcfgContainer [2023-11-19 07:35:40,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:35:40,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:35:40,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:35:40,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:35:40,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:38" (1/3) ... [2023-11-19 07:35:40,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262bcf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:40, skipping insertion in model container [2023-11-19 07:35:40,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:39" (2/3) ... [2023-11-19 07:35:40,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262bcf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:40, skipping insertion in model container [2023-11-19 07:35:40,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:40" (3/3) ... [2023-11-19 07:35:40,232 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:35:40,253 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:35:40,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 07:35:40,255 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:35:40,349 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:35:40,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 104 transitions, 216 flow [2023-11-19 07:35:40,473 INFO L124 PetriNetUnfolderBase]: 4/102 cut-off events. [2023-11-19 07:35:40,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:40,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 4/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:35:40,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 104 transitions, 216 flow [2023-11-19 07:35:40,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 102 transitions, 210 flow [2023-11-19 07:35:40,495 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:35:40,514 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 102 transitions, 210 flow [2023-11-19 07:35:40,520 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 102 transitions, 210 flow [2023-11-19 07:35:40,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 210 flow [2023-11-19 07:35:40,565 INFO L124 PetriNetUnfolderBase]: 4/102 cut-off events. [2023-11-19 07:35:40,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:40,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 4/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-19 07:35:40,570 INFO L119 LiptonReduction]: Number of co-enabled transitions 1536 [2023-11-19 07:35:50,178 INFO L134 LiptonReduction]: Checked pairs total: 3794 [2023-11-19 07:35:50,178 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-19 07:35:50,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:35:50,201 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;@34d8650d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:35:50,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 07:35:50,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:35:50,204 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:35:50,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:50,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:50,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:35:50,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:50,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 493, now seen corresponding path program 1 times [2023-11-19 07:35:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:35:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726028839] [2023-11-19 07:35:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:50,225 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-19 07:35:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:35:50,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:50,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:35:50,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:50,344 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-19 07:35:50,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:50,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:35:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726028839] [2023-11-19 07:35:50,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726028839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:50,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:50,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:35:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062147383] [2023-11-19 07:35:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:50,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:35:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:35:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:35:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:35:50,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-11-19 07:35:50,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:50,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:50,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-11-19 07:35:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:50,647 INFO L124 PetriNetUnfolderBase]: 175/311 cut-off events. [2023-11-19 07:35:50,648 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:35:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 311 events. 175/311 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1250 event pairs, 175 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 623. Up to 307 conditions per place. [2023-11-19 07:35:50,653 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-19 07:35:50,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-11-19 07:35:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:35:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:35:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-19 07:35:50,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611872146118721 [2023-11-19 07:35:50,675 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-19 07:35:50,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-19 07:35:50,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:50,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-19 07:35:50,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:50,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:50,696 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:50,698 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 202 transitions. [2023-11-19 07:35:50,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-11-19 07:35:50,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:35:50,704 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-19 07:35:50,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-19 07:35:50,710 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-19 07:35:50,711 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-19 07:35:50,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:50,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:50,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:35:50,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-19 07:35:50,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:50,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:50,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash 485996, now seen corresponding path program 1 times [2023-11-19 07:35:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:35:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423919750] [2023-11-19 07:35:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:50,917 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-19 07:35:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:35:50,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:50,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:35:51,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:51,073 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-19 07:35:51,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:51,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:35:51,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423919750] [2023-11-19 07:35:51,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423919750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:51,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:35:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720535361] [2023-11-19 07:35:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:51,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:35:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:51,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:51,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-11-19 07:35:51,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:51,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-11-19 07:35:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:51,240 INFO L124 PetriNetUnfolderBase]: 135/255 cut-off events. [2023-11-19 07:35:51,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:35:51,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 255 events. 135/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1020 event pairs, 39 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 505. Up to 199 conditions per place. [2023-11-19 07:35:51,248 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-11-19 07:35:51,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 110 flow [2023-11-19 07:35:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:35:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-19 07:35:51,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505327245053272 [2023-11-19 07:35:51,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-19 07:35:51,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-19 07:35:51,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:51,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-19 07:35:51,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,271 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 296 transitions. [2023-11-19 07:35:51,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 110 flow [2023-11-19 07:35:51,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:35:51,273 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-19 07:35:51,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-19 07:35:51,274 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-19 07:35:51,275 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-19 07:35:51,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:51,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:51,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:51,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:51,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:51,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2081514391, now seen corresponding path program 1 times [2023-11-19 07:35:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:35:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396642700] [2023-11-19 07:35:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:51,480 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-19 07:35:51,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:35:51,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:51,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:35:51,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:51,647 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-19 07:35:51,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:51,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:35:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396642700] [2023-11-19 07:35:51,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396642700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:51,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279731372] [2023-11-19 07:35:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:35:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:51,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 219 [2023-11-19 07:35:51,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 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-19 07:35:51,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:51,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 219 [2023-11-19 07:35:51,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:51,846 INFO L124 PetriNetUnfolderBase]: 56/129 cut-off events. [2023-11-19 07:35:51,847 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-19 07:35:51,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 129 events. 56/129 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 450 event pairs, 12 based on Foata normal form. 16/137 useless extension candidates. Maximal degree in co-relation 279. Up to 69 conditions per place. [2023-11-19 07:35:51,849 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 19 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-11-19 07:35:51,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 160 flow [2023-11-19 07:35:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:35:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:35:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2023-11-19 07:35:51,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42648401826484017 [2023-11-19 07:35:51,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 467 transitions. [2023-11-19 07:35:51,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 467 transitions. [2023-11-19 07:35:51,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:51,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 467 transitions. [2023-11-19 07:35:51,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,860 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 467 transitions. [2023-11-19 07:35:51,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 160 flow [2023-11-19 07:35:51,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:35:51,862 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-11-19 07:35:51,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-19 07:35:51,863 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-19 07:35:51,864 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-11-19 07:35:51,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 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-19 07:35:51,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:51,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:51,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:52,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1808837247, now seen corresponding path program 1 times [2023-11-19 07:35:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:35:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285081494] [2023-11-19 07:35:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:52,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:35:52,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:35:52,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:52,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:35:52,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:52,263 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-19 07:35:52,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:52,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:35:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285081494] [2023-11-19 07:35:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285081494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:35:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642631382] [2023-11-19 07:35:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:52,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:35:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:35:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:35:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:52,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 219 [2023-11-19 07:35:52,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:52,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:52,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 219 [2023-11-19 07:35:52,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:52,479 INFO L124 PetriNetUnfolderBase]: 20/60 cut-off events. [2023-11-19 07:35:52,479 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:35:52,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 60 events. 20/60 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 160. Up to 24 conditions per place. [2023-11-19 07:35:52,480 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 17 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2023-11-19 07:35:52,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 159 flow [2023-11-19 07:35:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:35:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2023-11-19 07:35:52,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4162861491628615 [2023-11-19 07:35:52,485 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 547 transitions. [2023-11-19 07:35:52,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 547 transitions. [2023-11-19 07:35:52,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:52,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 547 transitions. [2023-11-19 07:35:52,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:52,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:52,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:52,495 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 547 transitions. [2023-11-19 07:35:52,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 159 flow [2023-11-19 07:35:52,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 146 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:35:52,498 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 74 flow [2023-11-19 07:35:52,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-11-19 07:35:52,499 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-11-19 07:35:52,500 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 74 flow [2023-11-19 07:35:52,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:52,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:52,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:52,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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)] Ended with exit code 0 [2023-11-19 07:35:52,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:52,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash 812148895, now seen corresponding path program 1 times [2023-11-19 07:35:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:35:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232093766] [2023-11-19 07:35:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:52,706 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-19 07:35:52,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:35:52,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:52,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 07:35:52,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:53,077 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-19 07:35:53,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:53,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:35:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232093766] [2023-11-19 07:35:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232093766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:35:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769780489] [2023-11-19 07:35:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:53,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:53,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:35:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:53,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 219 [2023-11-19 07:35:53,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:53,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:53,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 219 [2023-11-19 07:35:53,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:35:53,329 INFO L124 PetriNetUnfolderBase]: 15/47 cut-off events. [2023-11-19 07:35:53,329 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-19 07:35:53,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 47 events. 15/47 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 7 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 129. Up to 38 conditions per place. [2023-11-19 07:35:53,330 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-19 07:35:53,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 20 transitions, 119 flow [2023-11-19 07:35:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:35:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:35:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-11-19 07:35:53,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3755707762557078 [2023-11-19 07:35:53,333 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-11-19 07:35:53,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-11-19 07:35:53,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:53,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-11-19 07:35:53,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:53,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:53,339 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:53,340 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 74 flow. Second operand 4 states and 329 transitions. [2023-11-19 07:35:53,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 20 transitions, 119 flow [2023-11-19 07:35:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 102 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-19 07:35:53,342 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 60 flow [2023-11-19 07:35:53,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2023-11-19 07:35:53,343 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-11-19 07:35:53,344 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 60 flow [2023-11-19 07:35:53,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:53,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:35:53,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:53,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-19 07:35:53,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:53,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 07:35:53,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -536333619, now seen corresponding path program 1 times [2023-11-19 07:35:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:35:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003476423] [2023-11-19 07:35:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:53,550 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-19 07:35:53,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:35:53,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:53,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12dfe96-6dbf-4ed8-b5ed-4ed4d99a5728/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:35:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:53,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-19 07:35:53,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:54,011 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-19 07:35:54,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:54,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:35:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003476423] [2023-11-19 07:35:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003476423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:54,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:35:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884197701] [2023-11-19 07:35:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:54,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:35:54,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:35:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:35:54,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:35:54,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 219 [2023-11-19 07:35:54,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 60 flow. Second operand has 8 states, 8 states have (on average 87.75) internal successors, (702), 8 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:54,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:35:54,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 219 [2023-11-19 07:35:54,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand