./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:14:52,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:14:52,199 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:14:52,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:14:52,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:14:52,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:14:52,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:14:52,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:14:52,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:14:52,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:14:52,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:14:52,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:14:52,251 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:14:52,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:14:52,253 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:14:52,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:14:52,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:14:52,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:14:52,255 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:14:52,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:14:52,257 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:14:52,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:14:52,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:14:52,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:14:52,259 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:14:52,260 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:14:52,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:14:52,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:14:52,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:14:52,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:52,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:14:52,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:14:52,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:14:52,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:14:52,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:14:52,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:14:52,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:14:52,266 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:14:52,267 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_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-12 02:14:52,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:14:52,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:14:52,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:14:52,680 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:14:52,681 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:14:52,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-12 02:14:55,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:14:56,103 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:14:56,104 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-12 02:14:56,122 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/data/fbac6fed2/deb9078e7499437b9f317c6e72d9ce7d/FLAGf5558f4df [2023-11-12 02:14:56,139 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/data/fbac6fed2/deb9078e7499437b9f317c6e72d9ce7d [2023-11-12 02:14:56,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:14:56,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:14:56,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:56,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:14:56,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:14:56,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:56" (1/1) ... [2023-11-12 02:14:56,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f0e1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:56, skipping insertion in model container [2023-11-12 02:14:56,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:56" (1/1) ... [2023-11-12 02:14:56,226 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:14:56,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:56,811 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:14:56,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:56,974 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:14:57,002 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:14:57,027 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:14:57,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57 WrapperNode [2023-11-12 02:14:57,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:57,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:57,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:14:57,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:14:57,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,086 INFO L138 Inliner]: procedures = 175, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-12 02:14:57,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:57,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:14:57,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:14:57,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:14:57,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:14:57,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:14:57,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:14:57,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:14:57,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (1/1) ... [2023-11-12 02:14:57,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:57,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:57,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:57,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:14:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:14:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:14:57,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:14:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:14:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:14:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:14:57,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:14:57,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:14:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:14:57,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:14:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:14:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:14:57,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:14:57,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:14:57,225 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:14:57,441 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:14:57,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:14:57,970 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:14:58,797 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:14:58,798 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:14:58,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:58 BoogieIcfgContainer [2023-11-12 02:14:58,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:14:58,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:14:58,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:14:58,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:14:58,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:14:56" (1/3) ... [2023-11-12 02:14:58,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cc9c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:58, skipping insertion in model container [2023-11-12 02:14:58,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:57" (2/3) ... [2023-11-12 02:14:58,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cc9c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:58, skipping insertion in model container [2023-11-12 02:14:58,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:58" (3/3) ... [2023-11-12 02:14:58,813 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-12 02:14:58,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:14:58,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-12 02:14:58,834 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:14:58,989 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:14:59,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 151 transitions, 310 flow [2023-11-12 02:14:59,155 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2023-11-12 02:14:59,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:14:59,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 149 events. 3/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 222 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-11-12 02:14:59,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 151 transitions, 310 flow [2023-11-12 02:14:59,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 149 transitions, 304 flow [2023-11-12 02:14:59,181 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:14:59,196 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 149 transitions, 304 flow [2023-11-12 02:14:59,200 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 149 transitions, 304 flow [2023-11-12 02:14:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 149 transitions, 304 flow [2023-11-12 02:14:59,271 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2023-11-12 02:14:59,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:14:59,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 149 events. 3/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 222 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-11-12 02:14:59,280 INFO L119 LiptonReduction]: Number of co-enabled transitions 4374 [2023-11-12 02:15:15,554 INFO L134 LiptonReduction]: Checked pairs total: 19492 [2023-11-12 02:15:15,555 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-11-12 02:15:15,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:15:15,578 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;@547d8618, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:15:15,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-12 02:15:15,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:15:15,581 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:15:15,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:15,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:15,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:15:15,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:15,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1030, now seen corresponding path program 1 times [2023-11-12 02:15:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926440084] [2023-11-12 02:15:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926440084] [2023-11-12 02:15:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926440084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:15:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233728035] [2023-11-12 02:15:15,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:15,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:15:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:15,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:15:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:15:15,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 284 [2023-11-12 02:15:15,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 120 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:15,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:15,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 284 [2023-11-12 02:15:15,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:16,852 INFO L124 PetriNetUnfolderBase]: 2439/3882 cut-off events. [2023-11-12 02:15:16,853 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-12 02:15:16,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7768 conditions, 3882 events. 2439/3882 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 25140 event pairs, 2439 based on Foata normal form. 0/1480 useless extension candidates. Maximal degree in co-relation 7758. Up to 3861 conditions per place. [2023-11-12 02:15:16,898 INFO L140 encePairwiseOnDemand]: 265/284 looper letters, 35 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-11-12 02:15:16,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 150 flow [2023-11-12 02:15:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:15:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:15:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 270 transitions. [2023-11-12 02:15:16,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753521126760563 [2023-11-12 02:15:16,922 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 270 transitions. [2023-11-12 02:15:16,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 270 transitions. [2023-11-12 02:15:16,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:16,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 270 transitions. [2023-11-12 02:15:16,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 135.0) internal successors, (270), 2 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-12 02:15:16,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:16,942 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:16,944 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 120 flow. Second operand 2 states and 270 transitions. [2023-11-12 02:15:16,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 150 flow [2023-11-12 02:15:16,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:16,952 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 78 flow [2023-11-12 02:15:16,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-11-12 02:15:16,960 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -20 predicate places. [2023-11-12 02:15:16,960 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 78 flow [2023-11-12 02:15:16,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:16,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:16,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-12 02:15:16,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:15:16,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:16,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash 31516946, now seen corresponding path program 1 times [2023-11-12 02:15:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:16,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958955898] [2023-11-12 02:15:16,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:16,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958955898] [2023-11-12 02:15:17,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958955898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:17,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:17,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149235414] [2023-11-12 02:15:17,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:17,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 284 [2023-11-12 02:15:17,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 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-12 02:15:17,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:17,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 284 [2023-11-12 02:15:17,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:18,197 INFO L124 PetriNetUnfolderBase]: 2181/3466 cut-off events. [2023-11-12 02:15:18,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6949 conditions, 3466 events. 2181/3466 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 24775 event pairs, 375 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 6946. Up to 2801 conditions per place. [2023-11-12 02:15:18,227 INFO L140 encePairwiseOnDemand]: 281/284 looper letters, 56 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-12 02:15:18,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 242 flow [2023-11-12 02:15:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-12 02:15:18,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4460093896713615 [2023-11-12 02:15:18,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-11-12 02:15:18,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-11-12 02:15:18,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:18,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-11-12 02:15:18,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:18,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:18,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:18,238 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 78 flow. Second operand 3 states and 380 transitions. [2023-11-12 02:15:18,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 242 flow [2023-11-12 02:15:18,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:15:18,241 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 80 flow [2023-11-12 02:15:18,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-12 02:15:18,242 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -19 predicate places. [2023-11-12 02:15:18,242 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 80 flow [2023-11-12 02:15:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 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-12 02:15:18,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:18,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:15:18,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:15:18,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:18,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 977026189, now seen corresponding path program 1 times [2023-11-12 02:15:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76260978] [2023-11-12 02:15:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76260978] [2023-11-12 02:15:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76260978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763555999] [2023-11-12 02:15:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:18,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:18,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 284 [2023-11-12 02:15:18,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:18,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:18,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 284 [2023-11-12 02:15:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:19,044 INFO L124 PetriNetUnfolderBase]: 972/1591 cut-off events. [2023-11-12 02:15:19,044 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2023-11-12 02:15:19,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1591 events. 972/1591 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8775 event pairs, 972 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 3269. Up to 1575 conditions per place. [2023-11-12 02:15:19,059 INFO L140 encePairwiseOnDemand]: 276/284 looper letters, 26 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-11-12 02:15:19,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 120 flow [2023-11-12 02:15:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-12 02:15:19,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-11-12 02:15:19,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-12 02:15:19,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-12 02:15:19,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:19,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-12 02:15:19,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,069 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 80 flow. Second operand 3 states and 355 transitions. [2023-11-12 02:15:19,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 120 flow [2023-11-12 02:15:19,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:19,071 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2023-11-12 02:15:19,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-12 02:15:19,072 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -26 predicate places. [2023-11-12 02:15:19,073 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2023-11-12 02:15:19,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:19,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:15:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:15:19,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:19,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash 977026186, now seen corresponding path program 1 times [2023-11-12 02:15:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:19,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512594284] [2023-11-12 02:15:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512594284] [2023-11-12 02:15:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512594284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34095424] [2023-11-12 02:15:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:19,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:19,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 284 [2023-11-12 02:15:19,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:19,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 284 [2023-11-12 02:15:19,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:19,526 INFO L124 PetriNetUnfolderBase]: 496/914 cut-off events. [2023-11-12 02:15:19,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:19,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 914 events. 496/914 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4828 event pairs, 318 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 1808. Up to 516 conditions per place. [2023-11-12 02:15:19,533 INFO L140 encePairwiseOnDemand]: 270/284 looper letters, 27 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2023-11-12 02:15:19,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 146 flow [2023-11-12 02:15:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-12 02:15:19,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41784037558685444 [2023-11-12 02:15:19,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-12 02:15:19,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-12 02:15:19,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:19,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-12 02:15:19,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,542 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 3 states and 356 transitions. [2023-11-12 02:15:19,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 146 flow [2023-11-12 02:15:19,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:19,544 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 117 flow [2023-11-12 02:15:19,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-11-12 02:15:19,545 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-11-12 02:15:19,545 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 117 flow [2023-11-12 02:15:19,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:19,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:19,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:15:19,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:19,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1263677372, now seen corresponding path program 1 times [2023-11-12 02:15:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54142480] [2023-11-12 02:15:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:19,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54142480] [2023-11-12 02:15:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54142480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:19,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381523983] [2023-11-12 02:15:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:19,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 284 [2023-11-12 02:15:19,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:19,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 284 [2023-11-12 02:15:19,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:19,970 INFO L124 PetriNetUnfolderBase]: 478/901 cut-off events. [2023-11-12 02:15:19,970 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-11-12 02:15:19,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 901 events. 478/901 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4838 event pairs, 159 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 2378. Up to 690 conditions per place. [2023-11-12 02:15:19,978 INFO L140 encePairwiseOnDemand]: 280/284 looper letters, 43 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-11-12 02:15:19,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 267 flow [2023-11-12 02:15:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-12 02:15:19,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42370892018779344 [2023-11-12 02:15:19,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-12 02:15:19,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-12 02:15:19,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:19,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-12 02:15:19,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,987 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 117 flow. Second operand 3 states and 361 transitions. [2023-11-12 02:15:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 267 flow [2023-11-12 02:15:19,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:19,993 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 116 flow [2023-11-12 02:15:19,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-11-12 02:15:19,994 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -24 predicate places. [2023-11-12 02:15:19,994 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 116 flow [2023-11-12 02:15:19,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:19,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:19,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:19,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:15:19,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:19,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1263677661, now seen corresponding path program 1 times [2023-11-12 02:15:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338763550] [2023-11-12 02:15:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338763550] [2023-11-12 02:15:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338763550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201116734] [2023-11-12 02:15:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:20,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:20,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:20,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:20,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 284 [2023-11-12 02:15:20,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:20,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:20,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 284 [2023-11-12 02:15:20,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:20,504 INFO L124 PetriNetUnfolderBase]: 471/854 cut-off events. [2023-11-12 02:15:20,505 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-11-12 02:15:20,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 854 events. 471/854 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4844 event pairs, 67 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 2309. Up to 757 conditions per place. [2023-11-12 02:15:20,513 INFO L140 encePairwiseOnDemand]: 281/284 looper letters, 48 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-12 02:15:20,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 292 flow [2023-11-12 02:15:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-12 02:15:20,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225352112676056 [2023-11-12 02:15:20,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-12 02:15:20,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-12 02:15:20,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:20,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-12 02:15:20,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:20,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:20,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:20,522 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 116 flow. Second operand 3 states and 360 transitions. [2023-11-12 02:15:20,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 292 flow [2023-11-12 02:15:20,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:20,525 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 118 flow [2023-11-12 02:15:20,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-12 02:15:20,526 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -23 predicate places. [2023-11-12 02:15:20,526 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 118 flow [2023-11-12 02:15:20,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:20,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:20,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:20,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:15:20,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:20,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 519300090, now seen corresponding path program 1 times [2023-11-12 02:15:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:20,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270049825] [2023-11-12 02:15:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270049825] [2023-11-12 02:15:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270049825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353047981] [2023-11-12 02:15:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:20,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:20,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 284 [2023-11-12 02:15:20,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:20,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:20,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 284 [2023-11-12 02:15:20,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:21,105 INFO L124 PetriNetUnfolderBase]: 464/874 cut-off events. [2023-11-12 02:15:21,106 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2023-11-12 02:15:21,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 874 events. 464/874 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4679 event pairs, 163 based on Foata normal form. 4/679 useless extension candidates. Maximal degree in co-relation 2378. Up to 677 conditions per place. [2023-11-12 02:15:21,114 INFO L140 encePairwiseOnDemand]: 281/284 looper letters, 42 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-11-12 02:15:21,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 259 flow [2023-11-12 02:15:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-12 02:15:21,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42488262910798125 [2023-11-12 02:15:21,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-12 02:15:21,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-12 02:15:21,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:21,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-12 02:15:21,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:21,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:21,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:21,123 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 118 flow. Second operand 3 states and 362 transitions. [2023-11-12 02:15:21,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 259 flow [2023-11-12 02:15:21,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:21,125 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 125 flow [2023-11-12 02:15:21,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-11-12 02:15:21,126 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -22 predicate places. [2023-11-12 02:15:21,126 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 125 flow [2023-11-12 02:15:21,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:21,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:21,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:21,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:15:21,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:21,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash 519300391, now seen corresponding path program 1 times [2023-11-12 02:15:21,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594917782] [2023-11-12 02:15:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:21,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:21,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594917782] [2023-11-12 02:15:21,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594917782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:21,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:15:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681263129] [2023-11-12 02:15:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:21,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:15:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:21,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:15:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:15:21,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 284 [2023-11-12 02:15:21,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:21,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:21,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 284 [2023-11-12 02:15:21,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:22,392 INFO L124 PetriNetUnfolderBase]: 442/840 cut-off events. [2023-11-12 02:15:22,393 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2023-11-12 02:15:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 840 events. 442/840 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4594 event pairs, 24 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 2333. Up to 310 conditions per place. [2023-11-12 02:15:22,403 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 62 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2023-11-12 02:15:22,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 451 flow [2023-11-12 02:15:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:15:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-12 02:15:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 970 transitions. [2023-11-12 02:15:22,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794992175273865 [2023-11-12 02:15:22,414 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 970 transitions. [2023-11-12 02:15:22,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 970 transitions. [2023-11-12 02:15:22,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:22,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 970 transitions. [2023-11-12 02:15:22,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:22,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:22,428 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:22,429 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 125 flow. Second operand 9 states and 970 transitions. [2023-11-12 02:15:22,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 451 flow [2023-11-12 02:15:22,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:22,435 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 187 flow [2023-11-12 02:15:22,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=187, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-12 02:15:22,443 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -17 predicate places. [2023-11-12 02:15:22,443 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 187 flow [2023-11-12 02:15:22,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:22,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:22,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:22,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:15:22,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:22,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:22,452 INFO L85 PathProgramCache]: Analyzing trace with hash 519300390, now seen corresponding path program 1 times [2023-11-12 02:15:22,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:22,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940597994] [2023-11-12 02:15:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:22,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940597994] [2023-11-12 02:15:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940597994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584884834] [2023-11-12 02:15:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:22,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:22,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 284 [2023-11-12 02:15:22,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:22,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:22,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 284 [2023-11-12 02:15:22,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:23,119 INFO L124 PetriNetUnfolderBase]: 458/885 cut-off events. [2023-11-12 02:15:23,119 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2023-11-12 02:15:23,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 885 events. 458/885 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4858 event pairs, 128 based on Foata normal form. 15/721 useless extension candidates. Maximal degree in co-relation 2664. Up to 398 conditions per place. [2023-11-12 02:15:23,127 INFO L140 encePairwiseOnDemand]: 276/284 looper letters, 35 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2023-11-12 02:15:23,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 329 flow [2023-11-12 02:15:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2023-11-12 02:15:23,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40580985915492956 [2023-11-12 02:15:23,131 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 461 transitions. [2023-11-12 02:15:23,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 461 transitions. [2023-11-12 02:15:23,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:23,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 461 transitions. [2023-11-12 02:15:23,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.25) internal successors, (461), 4 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-12 02:15:23,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,136 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 187 flow. Second operand 4 states and 461 transitions. [2023-11-12 02:15:23,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 329 flow [2023-11-12 02:15:23,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:15:23,139 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 206 flow [2023-11-12 02:15:23,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-11-12 02:15:23,140 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -19 predicate places. [2023-11-12 02:15:23,140 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 206 flow [2023-11-12 02:15:23,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:23,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:23,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:15:23,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:23,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1162810482, now seen corresponding path program 1 times [2023-11-12 02:15:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469768013] [2023-11-12 02:15:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:23,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:23,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469768013] [2023-11-12 02:15:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469768013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:23,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:23,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747823595] [2023-11-12 02:15:23,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:23,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:23,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:23,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 284 [2023-11-12 02:15:23,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:23,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 284 [2023-11-12 02:15:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:23,936 INFO L124 PetriNetUnfolderBase]: 816/1499 cut-off events. [2023-11-12 02:15:23,936 INFO L125 PetriNetUnfolderBase]: For 717/717 co-relation queries the response was YES. [2023-11-12 02:15:23,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 1499 events. 816/1499 cut-off events. For 717/717 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8656 event pairs, 171 based on Foata normal form. 16/1266 useless extension candidates. Maximal degree in co-relation 4702. Up to 638 conditions per place. [2023-11-12 02:15:23,949 INFO L140 encePairwiseOnDemand]: 280/284 looper letters, 74 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-11-12 02:15:23,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 78 transitions, 529 flow [2023-11-12 02:15:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-11-12 02:15:23,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128521126760563 [2023-11-12 02:15:23,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-11-12 02:15:23,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-11-12 02:15:23,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:23,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-11-12 02:15:23,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,958 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 206 flow. Second operand 4 states and 469 transitions. [2023-11-12 02:15:23,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 78 transitions, 529 flow [2023-11-12 02:15:23,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 78 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:23,964 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 212 flow [2023-11-12 02:15:23,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-12 02:15:23,966 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -15 predicate places. [2023-11-12 02:15:23,966 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 212 flow [2023-11-12 02:15:23,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:23,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:15:23,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:23,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1081502791, now seen corresponding path program 1 times [2023-11-12 02:15:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6716657] [2023-11-12 02:15:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:24,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6716657] [2023-11-12 02:15:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6716657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:24,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:24,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123052194] [2023-11-12 02:15:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:24,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:15:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:15:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:15:24,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 284 [2023-11-12 02:15:24,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:24,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 284 [2023-11-12 02:15:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:24,747 INFO L124 PetriNetUnfolderBase]: 506/994 cut-off events. [2023-11-12 02:15:24,747 INFO L125 PetriNetUnfolderBase]: For 634/634 co-relation queries the response was YES. [2023-11-12 02:15:24,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 994 events. 506/994 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5728 event pairs, 156 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 3037. Up to 374 conditions per place. [2023-11-12 02:15:24,758 INFO L140 encePairwiseOnDemand]: 279/284 looper letters, 48 selfloop transitions, 9 changer transitions 2/61 dead transitions. [2023-11-12 02:15:24,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 395 flow [2023-11-12 02:15:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:15:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:15:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-11-12 02:15:24,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.373943661971831 [2023-11-12 02:15:24,762 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-11-12 02:15:24,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-11-12 02:15:24,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:24,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-11-12 02:15:24,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,769 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,769 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 212 flow. Second operand 5 states and 531 transitions. [2023-11-12 02:15:24,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 395 flow [2023-11-12 02:15:24,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 381 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-12 02:15:24,773 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 182 flow [2023-11-12 02:15:24,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-11-12 02:15:24,774 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -15 predicate places. [2023-11-12 02:15:24,774 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 182 flow [2023-11-12 02:15:24,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:24,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:24,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:15:24,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:24,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1081502837, now seen corresponding path program 1 times [2023-11-12 02:15:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:24,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771866306] [2023-11-12 02:15:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:24,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771866306] [2023-11-12 02:15:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771866306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:24,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060347891] [2023-11-12 02:15:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:24,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:15:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:15:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:15:24,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 284 [2023-11-12 02:15:24,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:25,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 284 [2023-11-12 02:15:25,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:25,318 INFO L124 PetriNetUnfolderBase]: 406/815 cut-off events. [2023-11-12 02:15:25,319 INFO L125 PetriNetUnfolderBase]: For 751/752 co-relation queries the response was YES. [2023-11-12 02:15:25,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 815 events. 406/815 cut-off events. For 751/752 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4483 event pairs, 268 based on Foata normal form. 6/763 useless extension candidates. Maximal degree in co-relation 2480. Up to 494 conditions per place. [2023-11-12 02:15:25,326 INFO L140 encePairwiseOnDemand]: 274/284 looper letters, 34 selfloop transitions, 9 changer transitions 4/49 dead transitions. [2023-11-12 02:15:25,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 326 flow [2023-11-12 02:15:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-11-12 02:15:25,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3873239436619718 [2023-11-12 02:15:25,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-11-12 02:15:25,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-11-12 02:15:25,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:25,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-11-12 02:15:25,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 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-12 02:15:25,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:25,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:25,335 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 182 flow. Second operand 4 states and 440 transitions. [2023-11-12 02:15:25,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 326 flow [2023-11-12 02:15:25,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:15:25,338 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 221 flow [2023-11-12 02:15:25,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-12 02:15:25,339 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -14 predicate places. [2023-11-12 02:15:25,340 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 221 flow [2023-11-12 02:15:25,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:25,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:25,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:15:25,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:25,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 821383781, now seen corresponding path program 1 times [2023-11-12 02:15:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486081513] [2023-11-12 02:15:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486081513] [2023-11-12 02:15:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486081513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:26,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:15:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290091774] [2023-11-12 02:15:26,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:26,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:15:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:15:26,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:15:26,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 284 [2023-11-12 02:15:26,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:26,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:26,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 284 [2023-11-12 02:15:26,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:27,511 INFO L124 PetriNetUnfolderBase]: 428/867 cut-off events. [2023-11-12 02:15:27,511 INFO L125 PetriNetUnfolderBase]: For 854/855 co-relation queries the response was YES. [2023-11-12 02:15:27,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 867 events. 428/867 cut-off events. For 854/855 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4815 event pairs, 126 based on Foata normal form. 3/839 useless extension candidates. Maximal degree in co-relation 2850. Up to 696 conditions per place. [2023-11-12 02:15:27,517 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 65 selfloop transitions, 25 changer transitions 3/94 dead transitions. [2023-11-12 02:15:27,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 690 flow [2023-11-12 02:15:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:15:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-12 02:15:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1032 transitions. [2023-11-12 02:15:27,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36338028169014086 [2023-11-12 02:15:27,524 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1032 transitions. [2023-11-12 02:15:27,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1032 transitions. [2023-11-12 02:15:27,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:27,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1032 transitions. [2023-11-12 02:15:27,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.2) internal successors, (1032), 10 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:27,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 284.0) internal successors, (3124), 11 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:27,538 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 284.0) internal successors, (3124), 11 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:27,538 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 221 flow. Second operand 10 states and 1032 transitions. [2023-11-12 02:15:27,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 690 flow [2023-11-12 02:15:27,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 679 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:27,552 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 461 flow [2023-11-12 02:15:27,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=461, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-11-12 02:15:27,554 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-11-12 02:15:27,554 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 461 flow [2023-11-12 02:15:27,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:27,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:27,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:27,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:15:27,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:27,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash 833153559, now seen corresponding path program 1 times [2023-11-12 02:15:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376560530] [2023-11-12 02:15:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376560530] [2023-11-12 02:15:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376560530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681919238] [2023-11-12 02:15:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:27,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:27,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 284 [2023-11-12 02:15:27,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:27,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:27,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 284 [2023-11-12 02:15:27,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:28,039 INFO L124 PetriNetUnfolderBase]: 370/690 cut-off events. [2023-11-12 02:15:28,039 INFO L125 PetriNetUnfolderBase]: For 1330/1330 co-relation queries the response was YES. [2023-11-12 02:15:28,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 690 events. 370/690 cut-off events. For 1330/1330 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3252 event pairs, 206 based on Foata normal form. 23/709 useless extension candidates. Maximal degree in co-relation 2679. Up to 607 conditions per place. [2023-11-12 02:15:28,045 INFO L140 encePairwiseOnDemand]: 273/284 looper letters, 17 selfloop transitions, 1 changer transitions 42/62 dead transitions. [2023-11-12 02:15:28,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 575 flow [2023-11-12 02:15:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-11-12 02:15:28,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3855633802816901 [2023-11-12 02:15:28,051 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-11-12 02:15:28,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-11-12 02:15:28,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:28,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-11-12 02:15:28,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,058 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,059 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 461 flow. Second operand 4 states and 438 transitions. [2023-11-12 02:15:28,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 575 flow [2023-11-12 02:15:28,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 558 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:28,078 INFO L231 Difference]: Finished difference. Result has 62 places, 20 transitions, 113 flow [2023-11-12 02:15:28,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=62, PETRI_TRANSITIONS=20} [2023-11-12 02:15:28,079 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-11-12 02:15:28,079 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 20 transitions, 113 flow [2023-11-12 02:15:28,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:28,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:28,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:15:28,081 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:28,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -308189315, now seen corresponding path program 1 times [2023-11-12 02:15:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684053823] [2023-11-12 02:15:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:30,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684053823] [2023-11-12 02:15:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684053823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:30,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:15:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440020606] [2023-11-12 02:15:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:15:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:30,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:15:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:15:30,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 284 [2023-11-12 02:15:30,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 20 transitions, 113 flow. Second operand has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:30,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:30,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 284 [2023-11-12 02:15:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:30,712 INFO L124 PetriNetUnfolderBase]: 71/140 cut-off events. [2023-11-12 02:15:30,713 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-11-12 02:15:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 140 events. 71/140 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 396 event pairs, 10 based on Foata normal form. 4/144 useless extension candidates. Maximal degree in co-relation 452. Up to 77 conditions per place. [2023-11-12 02:15:30,714 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 20 selfloop transitions, 8 changer transitions 0/29 dead transitions. [2023-11-12 02:15:30,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 29 transitions, 191 flow [2023-11-12 02:15:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:15:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:15:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-11-12 02:15:30,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3544600938967136 [2023-11-12 02:15:30,720 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-11-12 02:15:30,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-11-12 02:15:30,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:30,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-11-12 02:15:30,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:30,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:30,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:30,729 INFO L175 Difference]: Start difference. First operand has 62 places, 20 transitions, 113 flow. Second operand 6 states and 604 transitions. [2023-11-12 02:15:30,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 29 transitions, 191 flow [2023-11-12 02:15:30,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 29 transitions, 162 flow, removed 4 selfloop flow, removed 12 redundant places. [2023-11-12 02:15:30,732 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 120 flow [2023-11-12 02:15:30,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2023-11-12 02:15:30,733 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -18 predicate places. [2023-11-12 02:15:30,733 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 120 flow [2023-11-12 02:15:30,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:30,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:30,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:30,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:15:30,735 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:30,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 346289746, now seen corresponding path program 1 times [2023-11-12 02:15:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:30,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234112941] [2023-11-12 02:15:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234112941] [2023-11-12 02:15:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234112941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:30,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:30,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250404502] [2023-11-12 02:15:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:30,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:30,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:30,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:30,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:30,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 284 [2023-11-12 02:15:30,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 21 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:30,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:30,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 284 [2023-11-12 02:15:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:31,058 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2023-11-12 02:15:31,059 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-11-12 02:15:31,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 71 events. 27/71 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 4 based on Foata normal form. 10/81 useless extension candidates. Maximal degree in co-relation 253. Up to 54 conditions per place. [2023-11-12 02:15:31,060 INFO L140 encePairwiseOnDemand]: 280/284 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2023-11-12 02:15:31,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 28 transitions, 210 flow [2023-11-12 02:15:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-11-12 02:15:31,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39436619718309857 [2023-11-12 02:15:31,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-11-12 02:15:31,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-11-12 02:15:31,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:31,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-11-12 02:15:31,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,069 INFO L175 Difference]: Start difference. First operand has 45 places, 21 transitions, 120 flow. Second operand 3 states and 336 transitions. [2023-11-12 02:15:31,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 28 transitions, 210 flow [2023-11-12 02:15:31,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 173 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-12 02:15:31,071 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 112 flow [2023-11-12 02:15:31,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2023-11-12 02:15:31,071 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -21 predicate places. [2023-11-12 02:15:31,072 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 112 flow [2023-11-12 02:15:31,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:31,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:31,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:15:31,073 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:31,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1824054610, now seen corresponding path program 1 times [2023-11-12 02:15:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707737896] [2023-11-12 02:15:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:33,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707737896] [2023-11-12 02:15:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707737896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:33,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:33,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:15:33,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280091341] [2023-11-12 02:15:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:33,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:15:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:33,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:15:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:15:33,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 284 [2023-11-12 02:15:33,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:33,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:33,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 284 [2023-11-12 02:15:33,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:34,090 INFO L124 PetriNetUnfolderBase]: 26/69 cut-off events. [2023-11-12 02:15:34,094 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-12 02:15:34,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 69 events. 26/69 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 9 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 235. Up to 57 conditions per place. [2023-11-12 02:15:34,095 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 19 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2023-11-12 02:15:34,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 27 transitions, 178 flow [2023-11-12 02:15:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:15:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:15:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2023-11-12 02:15:34,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34507042253521125 [2023-11-12 02:15:34,100 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2023-11-12 02:15:34,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2023-11-12 02:15:34,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:34,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2023-11-12 02:15:34,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,108 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,109 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 112 flow. Second operand 6 states and 588 transitions. [2023-11-12 02:15:34,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 27 transitions, 178 flow [2023-11-12 02:15:34,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 27 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:34,111 INFO L231 Difference]: Finished difference. Result has 47 places, 23 transitions, 128 flow [2023-11-12 02:15:34,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=23} [2023-11-12 02:15:34,112 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -16 predicate places. [2023-11-12 02:15:34,113 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 23 transitions, 128 flow [2023-11-12 02:15:34,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:34,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:15:34,115 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:34,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1799477035, now seen corresponding path program 1 times [2023-11-12 02:15:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:34,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833641681] [2023-11-12 02:15:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:34,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:15:34,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:34,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833641681] [2023-11-12 02:15:34,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833641681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:34,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111554483] [2023-11-12 02:15:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:34,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:34,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 284 [2023-11-12 02:15:34,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 23 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:34,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 284 [2023-11-12 02:15:34,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:34,461 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2023-11-12 02:15:34,461 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-12 02:15:34,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 35 events. 9/35 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 1 based on Foata normal form. 7/42 useless extension candidates. Maximal degree in co-relation 133. Up to 16 conditions per place. [2023-11-12 02:15:34,462 INFO L140 encePairwiseOnDemand]: 280/284 looper letters, 21 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-11-12 02:15:34,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 28 transitions, 207 flow [2023-11-12 02:15:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2023-11-12 02:15:34,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3882042253521127 [2023-11-12 02:15:34,466 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2023-11-12 02:15:34,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2023-11-12 02:15:34,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:34,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2023-11-12 02:15:34,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,473 INFO L175 Difference]: Start difference. First operand has 47 places, 23 transitions, 128 flow. Second operand 4 states and 441 transitions. [2023-11-12 02:15:34,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 28 transitions, 207 flow [2023-11-12 02:15:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 168 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-11-12 02:15:34,475 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 112 flow [2023-11-12 02:15:34,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2023-11-12 02:15:34,476 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -20 predicate places. [2023-11-12 02:15:34,476 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 112 flow [2023-11-12 02:15:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:34,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:15:34,477 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-12 02:15:34,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1146672612, now seen corresponding path program 1 times [2023-11-12 02:15:34,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:34,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474376499] [2023-11-12 02:15:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:15:34,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:15:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:15:34,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:15:34,899 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:15:34,901 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2023-11-12 02:15:34,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2023-11-12 02:15:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2023-11-12 02:15:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2023-11-12 02:15:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2023-11-12 02:15:34,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2023-11-12 02:15:34,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2023-11-12 02:15:34,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2023-11-12 02:15:34,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2023-11-12 02:15:34,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2023-11-12 02:15:34,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2023-11-12 02:15:34,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2023-11-12 02:15:34,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2023-11-12 02:15:34,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2023-11-12 02:15:34,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2023-11-12 02:15:34,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2023-11-12 02:15:34,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2023-11-12 02:15:34,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2023-11-12 02:15:34,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2023-11-12 02:15:34,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2023-11-12 02:15:34,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2023-11-12 02:15:34,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2023-11-12 02:15:34,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2023-11-12 02:15:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2023-11-12 02:15:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2023-11-12 02:15:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2023-11-12 02:15:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2023-11-12 02:15:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2023-11-12 02:15:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2023-11-12 02:15:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2023-11-12 02:15:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2023-11-12 02:15:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2023-11-12 02:15:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2023-11-12 02:15:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2023-11-12 02:15:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2023-11-12 02:15:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2023-11-12 02:15:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2023-11-12 02:15:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2023-11-12 02:15:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2023-11-12 02:15:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2023-11-12 02:15:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2023-11-12 02:15:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2023-11-12 02:15:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2023-11-12 02:15:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2023-11-12 02:15:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2023-11-12 02:15:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2023-11-12 02:15:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2023-11-12 02:15:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2023-11-12 02:15:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2023-11-12 02:15:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2023-11-12 02:15:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2023-11-12 02:15:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2023-11-12 02:15:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2023-11-12 02:15:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2023-11-12 02:15:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2023-11-12 02:15:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2023-11-12 02:15:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2023-11-12 02:15:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2023-11-12 02:15:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2023-11-12 02:15:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2023-11-12 02:15:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2023-11-12 02:15:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2023-11-12 02:15:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2023-11-12 02:15:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2023-11-12 02:15:34,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 02:15:34,918 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:34,928 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:15:34,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:15:35,008 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-12 02:15:35,011 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-12 02:15:35,025 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:15:35,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:15:35 BasicIcfg [2023-11-12 02:15:35,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:15:35,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:15:35,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:15:35,058 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:15:35,058 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:58" (3/4) ... [2023-11-12 02:15:35,060 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:15:35,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:15:35,063 INFO L158 Benchmark]: Toolchain (without parser) took 38919.09ms. Allocated memory was 174.1MB in the beginning and 557.8MB in the end (delta: 383.8MB). Free memory was 141.5MB in the beginning and 439.2MB in the end (delta: -297.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2023-11-12 02:15:35,063 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory was 101.8MB in the beginning and 101.7MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:15:35,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 882.94ms. Allocated memory is still 174.1MB. Free memory was 141.3MB in the beginning and 138.0MB in the end (delta: 3.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-11-12 02:15:35,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.28ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 136.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:15:35,064 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 133.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:15:35,065 INFO L158 Benchmark]: RCFGBuilder took 1672.30ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 133.2MB in the beginning and 154.1MB in the end (delta: -20.9MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2023-11-12 02:15:35,065 INFO L158 Benchmark]: TraceAbstraction took 36251.84ms. Allocated memory was 209.7MB in the beginning and 557.8MB in the end (delta: 348.1MB). Free memory was 153.1MB in the beginning and 440.2MB in the end (delta: -287.1MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2023-11-12 02:15:35,066 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 557.8MB. Free memory was 440.2MB in the beginning and 439.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:15:35,069 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.23ms. Allocated memory is still 130.0MB. Free memory was 101.8MB in the beginning and 101.7MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 882.94ms. Allocated memory is still 174.1MB. Free memory was 141.3MB in the beginning and 138.0MB in the end (delta: 3.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.28ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 136.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 133.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1672.30ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 133.2MB in the beginning and 154.1MB in the end (delta: -20.9MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * TraceAbstraction took 36251.84ms. Allocated memory was 209.7MB in the beginning and 557.8MB in the end (delta: 348.1MB). Free memory was 153.1MB in the beginning and 440.2MB in the end (delta: -287.1MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 557.8MB. Free memory was 440.2MB in the beginning and 439.2MB 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~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 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: 16.4s, 153 PlacesBefore, 63 PlacesAfterwards, 149 TransitionsBefore, 57 TransitionsAfterwards, 4374 CoEnabledTransitionPairs, 8 FixpointIterations, 56 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 133 TotalNumberOfCompositions, 19492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5802, independent: 5358, independent conditional: 0, independent unconditional: 5358, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1997, independent: 1932, independent conditional: 0, independent unconditional: 1932, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5802, independent: 3426, independent conditional: 0, independent unconditional: 3426, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 1997, unknown conditional: 0, unknown unconditional: 1997] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923={5:0}, t1924={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={5:0}, t1924={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] 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", "safe006_power.opt-thin000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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, 192 locations, 64 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: 35.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1321 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 968 mSDsluCounter, 635 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2025 IncrementalHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 178 mSDtfsCounter, 2025 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=13, InterpolantAutomatonStates: 79, 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.7s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:15:35,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:15:38,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:15:38,277 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:15:38,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:15:38,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:15:38,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:15:38,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:15:38,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:15:38,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:15:38,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:15:38,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:15:38,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:15:38,373 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:15:38,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:15:38,376 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:15:38,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:15:38,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:15:38,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:15:38,378 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:15:38,380 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:15:38,381 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:15:38,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:15:38,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:15:38,382 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:15:38,383 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:15:38,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:15:38,384 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:15:38,385 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:15:38,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:15:38,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:15:38,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:15:38,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:15:38,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:15:38,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:15:38,390 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:15:38,390 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:15:38,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:15:38,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:15:38,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:15:38,393 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:15:38,393 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:15:38,394 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_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-12 02:15:38,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:15:38,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:15:38,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:15:38,924 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:15:38,924 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:15:38,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b44e4108-da0f-4aa8-b58e-ad7f7c4058ba/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i