./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:41:59,062 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:41:59,178 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-11-19 07:41:59,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:41:59,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:41:59,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:41:59,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:41:59,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:41:59,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:41:59,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:41:59,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:41:59,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:41:59,221 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:41:59,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:41:59,225 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:41:59,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:41:59,227 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:41:59,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:41:59,232 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 07:41:59,232 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-19 07:41:59,233 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-19 07:41:59,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:41:59,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 07:41:59,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 07:41:59,235 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:41:59,235 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:41:59,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:41:59,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:41:59,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:41:59,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:41:59,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:41:59,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:41:59,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:41:59,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:41:59,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:41:59,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:41:59,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:41:59,241 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:41:59,241 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_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b
[2023-11-19 07:41:59,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:41:59,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:41:59,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:41:59,605 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:41:59,606 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:41:59,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:42:02,880 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:42:03,194 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:42:03,194 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:42:03,222 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data/e670f9f3c/21a2410d6d9f45e7bc69310ab7a4cbb2/FLAG2c37eb8aa
[2023-11-19 07:42:03,237 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data/e670f9f3c/21a2410d6d9f45e7bc69310ab7a4cbb2
[2023-11-19 07:42:03,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:42:03,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:42:03,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:42:03,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:42:03,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:42:03,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:03,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5226ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03, skipping insertion in model container
[2023-11-19 07:42:03,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:03,306 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:42:03,766 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:42:03,779 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:42:03,887 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:42:03,936 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:42:03,937 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:42:03,944 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:42:03,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03 WrapperNode
[2023-11-19 07:42:03,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:42:03,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:42:03,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:42:03,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:42:03,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:03,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,024 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136
[2023-11-19 07:42:04,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:42:04,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:42:04,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:42:04,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:42:04,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:42:04,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:42:04,111 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:42:04,112 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:42:04,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (1/1) ...
[2023-11-19 07:42:04,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:42:04,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:42:04,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:42:04,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:42:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:42:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:42:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:42:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:42:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:42:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:42:04,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:42:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:42:04,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:42:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:42:04,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:42:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:42:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:42:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:42:04,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:42:04,326 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 07:42:04,496 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:42:04,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:42:04,969 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:42:05,170 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:42:05,171 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:42:05,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:05 BoogieIcfgContainer
[2023-11-19 07:42:05,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:42:05,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:42:05,184 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:42:05,188 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:42:05,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:03" (1/3) ...
[2023-11-19 07:42:05,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771b9e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:05, skipping insertion in model container
[2023-11-19 07:42:05,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:03" (2/3) ...
[2023-11-19 07:42:05,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771b9e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:05, skipping insertion in model container
[2023-11-19 07:42:05,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:05" (3/3) ...
[2023-11-19 07:42:05,195 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:42:05,219 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:42:05,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-19 07:42:05,220 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:42:05,304 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:42:05,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 133 transitions, 278 flow
[2023-11-19 07:42:05,420 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events.
[2023-11-19 07:42:05,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:05,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 4/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place.
[2023-11-19 07:42:05,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 133 transitions, 278 flow
[2023-11-19 07:42:05,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 130 transitions, 269 flow
[2023-11-19 07:42:05,439 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:42:05,450 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 130 transitions, 269 flow
[2023-11-19 07:42:05,453 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 130 transitions, 269 flow
[2023-11-19 07:42:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 130 transitions, 269 flow
[2023-11-19 07:42:05,494 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events.
[2023-11-19 07:42:05,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 4/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place.
[2023-11-19 07:42:05,505 INFO L119 LiptonReduction]: Number of co-enabled transitions 3068
[2023-11-19 07:42:11,116 INFO L134 LiptonReduction]: Checked pairs total: 8047
[2023-11-19 07:42:11,117 INFO L136 LiptonReduction]: Total number of compositions: 126
[2023-11-19 07:42:11,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:42:11,167 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;@1bade11e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:42:11,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-19 07:42:11,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:42:11,178 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events.
[2023-11-19 07:42:11,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:11,179 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:11,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-11-19 07:42:11,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:11,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash 584, now seen corresponding path program 1 times
[2023-11-19 07:42:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:11,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352397359]
[2023-11-19 07:42:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352397359]
[2023-11-19 07:42:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352397359] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-19 07:42:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636375426]
[2023-11-19 07:42:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 07:42:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:11,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 07:42:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:42:11,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 259
[2023-11-19 07:42:11,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:11,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:11,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 259
[2023-11-19 07:42:11,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:12,118 INFO L124 PetriNetUnfolderBase]: 2064/3056 cut-off events.
[2023-11-19 07:42:12,118 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2023-11-19 07:42:12,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 3056 events. 2064/3056 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14964 event pairs, 2064 based on Foata normal form. 0/2588 useless extension candidates. Maximal degree in co-relation 6112. Up to 3001 conditions per place.
[2023-11-19 07:42:12,149 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions.
[2023-11-19 07:42:12,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 111 flow
[2023-11-19 07:42:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 07:42:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-19 07:42:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 267 transitions.
[2023-11-19 07:42:12,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154440154440154
[2023-11-19 07:42:12,174 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 267 transitions.
[2023-11-19 07:42:12,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 267 transitions.
[2023-11-19 07:42:12,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:12,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 267 transitions.
[2023-11-19 07:42:12,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:12,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:12,194 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:12,196 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 267 transitions.
[2023-11-19 07:42:12,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 111 flow
[2023-11-19 07:42:12,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 07:42:12,204 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow
[2023-11-19 07:42:12,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27}
[2023-11-19 07:42:12,211 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places.
[2023-11-19 07:42:12,212 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow
[2023-11-19 07:42:12,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:12,212 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:12,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-19 07:42:12,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:42:12,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:12,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 575837, now seen corresponding path program 1 times
[2023-11-19 07:42:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935328175]
[2023-11-19 07:42:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935328175]
[2023-11-19 07:42:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935328175] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:42:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133109835]
[2023-11-19 07:42:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:12,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:42:12,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:42:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:42:12,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 259
[2023-11-19 07:42:12,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:12,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:12,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 259
[2023-11-19 07:42:12,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:13,081 INFO L124 PetriNetUnfolderBase]: 1614/2561 cut-off events.
[2023-11-19 07:42:13,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:13,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 2561 events. 1614/2561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14449 event pairs, 264 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 4974. Up to 1912 conditions per place.
[2023-11-19 07:42:13,104 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 37 selfloop transitions, 2 changer transitions 2/44 dead transitions.
[2023-11-19 07:42:13,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 180 flow
[2023-11-19 07:42:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:42:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:42:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions.
[2023-11-19 07:42:13,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057915057915058
[2023-11-19 07:42:13,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions.
[2023-11-19 07:42:13,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions.
[2023-11-19 07:42:13,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:13,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions.
[2023-11-19 07:42:13,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:13,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:13,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:13,120 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 393 transitions.
[2023-11-19 07:42:13,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 180 flow
[2023-11-19 07:42:13,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:42:13,122 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 60 flow
[2023-11-19 07:42:13,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=25}
[2023-11-19 07:42:13,124 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places.
[2023-11-19 07:42:13,125 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 60 flow
[2023-11-19 07:42:13,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:13,126 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:13,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:13,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:42:13,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:13,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2038670663, now seen corresponding path program 1 times
[2023-11-19 07:42:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001832039]
[2023-11-19 07:42:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:13,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001832039]
[2023-11-19 07:42:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001832039] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:13,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:13,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:42:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756581941]
[2023-11-19 07:42:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:13,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:42:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:42:13,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:42:13,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 259
[2023-11-19 07:42:13,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:13,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:13,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 259
[2023-11-19 07:42:13,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:14,547 INFO L124 PetriNetUnfolderBase]: 4111/6030 cut-off events.
[2023-11-19 07:42:14,548 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES.
[2023-11-19 07:42:14,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12463 conditions, 6030 events. 4111/6030 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31299 event pairs, 1363 based on Foata normal form. 0/5860 useless extension candidates. Maximal degree in co-relation 12459. Up to 3784 conditions per place.
[2023-11-19 07:42:14,603 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions.
[2023-11-19 07:42:14,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 194 flow
[2023-11-19 07:42:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:42:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:42:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions.
[2023-11-19 07:42:14,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2023-11-19 07:42:14,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions.
[2023-11-19 07:42:14,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions.
[2023-11-19 07:42:14,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:14,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions.
[2023-11-19 07:42:14,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:14,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:14,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:14,612 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 60 flow. Second operand 3 states and 370 transitions.
[2023-11-19 07:42:14,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 194 flow
[2023-11-19 07:42:14,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:42:14,616 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 118 flow
[2023-11-19 07:42:14,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2023-11-19 07:42:14,618 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places.
[2023-11-19 07:42:14,618 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 118 flow
[2023-11-19 07:42:14,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:14,619 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:14,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:42:14,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:14,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1225717661, now seen corresponding path program 1 times
[2023-11-19 07:42:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34681664]
[2023-11-19 07:42:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:14,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34681664]
[2023-11-19 07:42:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34681664] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:14,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:14,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:42:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109273275]
[2023-11-19 07:42:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:14,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:42:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:42:14,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:42:14,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 259
[2023-11-19 07:42:14,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:14,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:14,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 259
[2023-11-19 07:42:14,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:15,986 INFO L124 PetriNetUnfolderBase]: 3937/5776 cut-off events.
[2023-11-19 07:42:15,987 INFO L125 PetriNetUnfolderBase]: For 2540/2540 co-relation queries the response was YES.
[2023-11-19 07:42:16,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14792 conditions, 5776 events. 3937/5776 cut-off events. For 2540/2540 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 29821 event pairs, 784 based on Foata normal form. 50/5826 useless extension candidates. Maximal degree in co-relation 14787. Up to 2741 conditions per place.
[2023-11-19 07:42:16,049 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 56 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2023-11-19 07:42:16,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 338 flow
[2023-11-19 07:42:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:42:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:42:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions.
[2023-11-19 07:42:16,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47393822393822393
[2023-11-19 07:42:16,053 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions.
[2023-11-19 07:42:16,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions.
[2023-11-19 07:42:16,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:16,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions.
[2023-11-19 07:42:16,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:16,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:16,060 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:16,060 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 118 flow. Second operand 4 states and 491 transitions.
[2023-11-19 07:42:16,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 338 flow
[2023-11-19 07:42:16,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:42:16,082 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 160 flow
[2023-11-19 07:42:16,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=36}
[2023-11-19 07:42:16,084 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places.
[2023-11-19 07:42:16,085 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 160 flow
[2023-11-19 07:42:16,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:16,085 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:16,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:16,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:42:16,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:16,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1225719421, now seen corresponding path program 1 times
[2023-11-19 07:42:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939672315]
[2023-11-19 07:42:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:16,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:16,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939672315]
[2023-11-19 07:42:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939672315] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:16,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:16,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:42:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937243729]
[2023-11-19 07:42:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:16,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:42:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:42:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:42:16,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259
[2023-11-19 07:42:16,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:16,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:16,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259
[2023-11-19 07:42:16,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:17,901 INFO L124 PetriNetUnfolderBase]: 2931/4654 cut-off events.
[2023-11-19 07:42:17,901 INFO L125 PetriNetUnfolderBase]: For 3231/3388 co-relation queries the response was YES.
[2023-11-19 07:42:17,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12052 conditions, 4654 events. 2931/4654 cut-off events. For 3231/3388 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 27476 event pairs, 762 based on Foata normal form. 291/4831 useless extension candidates. Maximal degree in co-relation 12045. Up to 2864 conditions per place.
[2023-11-19 07:42:17,943 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 40 selfloop transitions, 7 changer transitions 17/72 dead transitions.
[2023-11-19 07:42:17,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 408 flow
[2023-11-19 07:42:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:42:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:42:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2023-11-19 07:42:17,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246
[2023-11-19 07:42:17,948 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2023-11-19 07:42:17,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2023-11-19 07:42:17,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:17,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2023-11-19 07:42:17,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:17,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:17,959 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:17,959 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 160 flow. Second operand 6 states and 672 transitions.
[2023-11-19 07:42:17,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 408 flow
[2023-11-19 07:42:17,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:42:17,998 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 194 flow
[2023-11-19 07:42:17,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=48, PETRI_TRANSITIONS=38}
[2023-11-19 07:42:17,999 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places.
[2023-11-19 07:42:18,000 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 194 flow
[2023-11-19 07:42:18,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:18,001 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:18,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:18,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:42:18,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:18,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash 19054443, now seen corresponding path program 1 times
[2023-11-19 07:42:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187667055]
[2023-11-19 07:42:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187667055]
[2023-11-19 07:42:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187667055] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:42:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72095446]
[2023-11-19 07:42:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:18,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:42:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:42:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:42:18,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 259
[2023-11-19 07:42:18,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:18,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:18,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 259
[2023-11-19 07:42:18,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:18,870 INFO L124 PetriNetUnfolderBase]: 2641/4039 cut-off events.
[2023-11-19 07:42:18,870 INFO L125 PetriNetUnfolderBase]: For 3204/3258 co-relation queries the response was YES.
[2023-11-19 07:42:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11066 conditions, 4039 events. 2641/4039 cut-off events. For 3204/3258 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21118 event pairs, 947 based on Foata normal form. 43/4019 useless extension candidates. Maximal degree in co-relation 11055. Up to 2772 conditions per place.
[2023-11-19 07:42:18,908 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions.
[2023-11-19 07:42:18,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 342 flow
[2023-11-19 07:42:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:42:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:42:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions.
[2023-11-19 07:42:18,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929214929214929
[2023-11-19 07:42:18,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions.
[2023-11-19 07:42:18,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions.
[2023-11-19 07:42:18,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:18,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions.
[2023-11-19 07:42:18,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:18,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:18,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:18,916 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 194 flow. Second operand 3 states and 383 transitions.
[2023-11-19 07:42:18,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 342 flow
[2023-11-19 07:42:18,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 329 flow, removed 2 selfloop flow, removed 3 redundant places.
[2023-11-19 07:42:18,950 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 199 flow
[2023-11-19 07:42:18,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=47, PETRI_TRANSITIONS=38}
[2023-11-19 07:42:18,951 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places.
[2023-11-19 07:42:18,952 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 199 flow
[2023-11-19 07:42:18,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:18,952 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:18,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:18,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:42:18,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:18,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 530433567, now seen corresponding path program 1 times
[2023-11-19 07:42:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643833833]
[2023-11-19 07:42:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:19,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643833833]
[2023-11-19 07:42:19,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643833833] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:19,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:42:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720412759]
[2023-11-19 07:42:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:19,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:42:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:19,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:42:19,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:42:19,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259
[2023-11-19 07:42:19,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:19,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:19,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259
[2023-11-19 07:42:19,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:20,409 INFO L124 PetriNetUnfolderBase]: 2601/4051 cut-off events.
[2023-11-19 07:42:20,409 INFO L125 PetriNetUnfolderBase]: For 3481/3534 co-relation queries the response was YES.
[2023-11-19 07:42:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11130 conditions, 4051 events. 2601/4051 cut-off events. For 3481/3534 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21800 event pairs, 559 based on Foata normal form. 173/4170 useless extension candidates. Maximal degree in co-relation 11119. Up to 2673 conditions per place.
[2023-11-19 07:42:20,440 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 45 selfloop transitions, 7 changer transitions 14/71 dead transitions.
[2023-11-19 07:42:20,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 447 flow
[2023-11-19 07:42:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:42:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:42:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2023-11-19 07:42:20,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246
[2023-11-19 07:42:20,444 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2023-11-19 07:42:20,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2023-11-19 07:42:20,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:20,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2023-11-19 07:42:20,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,452 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,452 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 199 flow. Second operand 6 states and 672 transitions.
[2023-11-19 07:42:20,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 447 flow
[2023-11-19 07:42:20,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:42:20,478 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 216 flow
[2023-11-19 07:42:20,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=38}
[2023-11-19 07:42:20,479 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2023-11-19 07:42:20,479 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 216 flow
[2023-11-19 07:42:20,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,480 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:20,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:20,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:42:20,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:20,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash -802293797, now seen corresponding path program 1 times
[2023-11-19 07:42:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389926671]
[2023-11-19 07:42:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389926671]
[2023-11-19 07:42:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389926671] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:42:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820434740]
[2023-11-19 07:42:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:20,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:42:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:42:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:42:20,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259
[2023-11-19 07:42:20,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:20,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259
[2023-11-19 07:42:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:20,942 INFO L124 PetriNetUnfolderBase]: 1116/1899 cut-off events.
[2023-11-19 07:42:20,943 INFO L125 PetriNetUnfolderBase]: For 1941/2013 co-relation queries the response was YES.
[2023-11-19 07:42:20,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5365 conditions, 1899 events. 1116/1899 cut-off events. For 1941/2013 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10066 event pairs, 286 based on Foata normal form. 101/1971 useless extension candidates. Maximal degree in co-relation 5352. Up to 1477 conditions per place.
[2023-11-19 07:42:20,957 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 48 selfloop transitions, 4 changer transitions 0/60 dead transitions.
[2023-11-19 07:42:20,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 428 flow
[2023-11-19 07:42:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:42:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:42:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions.
[2023-11-19 07:42:20,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48906048906048905
[2023-11-19 07:42:20,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions.
[2023-11-19 07:42:20,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions.
[2023-11-19 07:42:20,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:20,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions.
[2023-11-19 07:42:20,961 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-19 07:42:20,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,964 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 216 flow. Second operand 3 states and 380 transitions.
[2023-11-19 07:42:20,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 428 flow
[2023-11-19 07:42:20,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 406 flow, removed 1 selfloop flow, removed 5 redundant places.
[2023-11-19 07:42:20,973 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 226 flow
[2023-11-19 07:42:20,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=49, PETRI_TRANSITIONS=41}
[2023-11-19 07:42:20,974 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2023-11-19 07:42:20,974 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 226 flow
[2023-11-19 07:42:20,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:20,975 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:20,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:20,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:42:20,975 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:20,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 361732593, now seen corresponding path program 1 times
[2023-11-19 07:42:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505650616]
[2023-11-19 07:42:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505650616]
[2023-11-19 07:42:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505650616] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:21,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:21,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:42:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507395709]
[2023-11-19 07:42:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:21,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:42:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:42:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:42:21,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259
[2023-11-19 07:42:21,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:21,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:21,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259
[2023-11-19 07:42:21,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:21,419 INFO L124 PetriNetUnfolderBase]: 501/937 cut-off events.
[2023-11-19 07:42:21,419 INFO L125 PetriNetUnfolderBase]: For 913/935 co-relation queries the response was YES.
[2023-11-19 07:42:21,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 937 events. 501/937 cut-off events. For 913/935 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4575 event pairs, 148 based on Foata normal form. 93/1017 useless extension candidates. Maximal degree in co-relation 3006. Up to 318 conditions per place.
[2023-11-19 07:42:21,427 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 61 selfloop transitions, 7 changer transitions 0/76 dead transitions.
[2023-11-19 07:42:21,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 527 flow
[2023-11-19 07:42:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:42:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:42:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions.
[2023-11-19 07:42:21,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4893822393822394
[2023-11-19 07:42:21,430 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions.
[2023-11-19 07:42:21,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions.
[2023-11-19 07:42:21,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:21,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions.
[2023-11-19 07:42:21,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:21,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:21,439 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:21,439 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 226 flow. Second operand 4 states and 507 transitions.
[2023-11-19 07:42:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 527 flow
[2023-11-19 07:42:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 523 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:42:21,446 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 262 flow
[2023-11-19 07:42:21,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=52, PETRI_TRANSITIONS=44}
[2023-11-19 07:42:21,447 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2023-11-19 07:42:21,447 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 262 flow
[2023-11-19 07:42:21,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:21,448 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:21,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:21,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:42:21,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:21,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1853014603, now seen corresponding path program 1 times
[2023-11-19 07:42:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:21,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176958720]
[2023-11-19 07:42:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:22,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176958720]
[2023-11-19 07:42:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176958720] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:22,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:22,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:42:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35172350]
[2023-11-19 07:42:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:22,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:42:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:42:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:42:22,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 259
[2023-11-19 07:42:22,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:22,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:22,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 259
[2023-11-19 07:42:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:22,873 INFO L124 PetriNetUnfolderBase]: 897/1576 cut-off events.
[2023-11-19 07:42:22,873 INFO L125 PetriNetUnfolderBase]: For 2704/2704 co-relation queries the response was YES.
[2023-11-19 07:42:22,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5555 conditions, 1576 events. 897/1576 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7770 event pairs, 31 based on Foata normal form. 11/1587 useless extension candidates. Maximal degree in co-relation 5541. Up to 521 conditions per place.
[2023-11-19 07:42:22,884 INFO L140 encePairwiseOnDemand]: 244/259 looper letters, 102 selfloop transitions, 57 changer transitions 0/159 dead transitions.
[2023-11-19 07:42:22,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 159 transitions, 1204 flow
[2023-11-19 07:42:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:42:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-19 07:42:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1054 transitions.
[2023-11-19 07:42:22,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521664521664522
[2023-11-19 07:42:22,889 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1054 transitions.
[2023-11-19 07:42:22,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1054 transitions.
[2023-11-19 07:42:22,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:22,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1054 transitions.
[2023-11-19 07:42:22,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.11111111111111) internal successors, (1054), 9 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:22,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:22,899 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:22,899 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 262 flow. Second operand 9 states and 1054 transitions.
[2023-11-19 07:42:22,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 159 transitions, 1204 flow
[2023-11-19 07:42:22,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 159 transitions, 1144 flow, removed 14 selfloop flow, removed 2 redundant places.
[2023-11-19 07:42:22,915 INFO L231 Difference]: Finished difference. Result has 65 places, 91 transitions, 752 flow
[2023-11-19 07:42:22,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=752, PETRI_PLACES=65, PETRI_TRANSITIONS=91}
[2023-11-19 07:42:22,918 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places.
[2023-11-19 07:42:22,918 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 91 transitions, 752 flow
[2023-11-19 07:42:22,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:22,919 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:22,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:42:22,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:22,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 138947818, now seen corresponding path program 1 times
[2023-11-19 07:42:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795700619]
[2023-11-19 07:42:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795700619]
[2023-11-19 07:42:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795700619] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:42:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344310537]
[2023-11-19 07:42:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:23,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:42:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:42:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:42:23,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259
[2023-11-19 07:42:23,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 91 transitions, 752 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:23,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:23,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259
[2023-11-19 07:42:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:23,508 INFO L124 PetriNetUnfolderBase]: 628/1139 cut-off events.
[2023-11-19 07:42:23,508 INFO L125 PetriNetUnfolderBase]: For 3874/3937 co-relation queries the response was YES.
[2023-11-19 07:42:23,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5257 conditions, 1139 events. 628/1139 cut-off events. For 3874/3937 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5888 event pairs, 68 based on Foata normal form. 61/1183 useless extension candidates. Maximal degree in co-relation 5236. Up to 450 conditions per place.
[2023-11-19 07:42:23,520 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 111 selfloop transitions, 10 changer transitions 0/144 dead transitions.
[2023-11-19 07:42:23,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 144 transitions, 1383 flow
[2023-11-19 07:42:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:42:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:42:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions.
[2023-11-19 07:42:23,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47953667953667956
[2023-11-19 07:42:23,524 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions.
[2023-11-19 07:42:23,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions.
[2023-11-19 07:42:23,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:23,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions.
[2023-11-19 07:42:23,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:23,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:23,531 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:23,531 INFO L175 Difference]: Start difference. First operand has 65 places, 91 transitions, 752 flow. Second operand 5 states and 621 transitions.
[2023-11-19 07:42:23,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 144 transitions, 1383 flow
[2023-11-19 07:42:23,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 144 transitions, 1313 flow, removed 10 selfloop flow, removed 4 redundant places.
[2023-11-19 07:42:23,551 INFO L231 Difference]: Finished difference. Result has 66 places, 88 transitions, 702 flow
[2023-11-19 07:42:23,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=66, PETRI_TRANSITIONS=88}
[2023-11-19 07:42:23,552 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2023-11-19 07:42:23,552 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 88 transitions, 702 flow
[2023-11-19 07:42:23,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:23,552 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:23,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:23,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:42:23,553 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:23,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1212499100, now seen corresponding path program 1 times
[2023-11-19 07:42:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209955160]
[2023-11-19 07:42:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:42:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209955160]
[2023-11-19 07:42:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209955160] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:42:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728026843]
[2023-11-19 07:42:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:24,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:42:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:42:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:42:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:42:24,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259
[2023-11-19 07:42:24,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 88 transitions, 702 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:24,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:24,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259
[2023-11-19 07:42:24,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:42:25,027 INFO L124 PetriNetUnfolderBase]: 803/1388 cut-off events.
[2023-11-19 07:42:25,027 INFO L125 PetriNetUnfolderBase]: For 4901/4901 co-relation queries the response was YES.
[2023-11-19 07:42:25,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6665 conditions, 1388 events. 803/1388 cut-off events. For 4901/4901 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6781 event pairs, 91 based on Foata normal form. 1/1389 useless extension candidates. Maximal degree in co-relation 6646. Up to 383 conditions per place.
[2023-11-19 07:42:25,039 INFO L140 encePairwiseOnDemand]: 247/259 looper letters, 118 selfloop transitions, 58 changer transitions 0/176 dead transitions.
[2023-11-19 07:42:25,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 1664 flow
[2023-11-19 07:42:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-19 07:42:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-19 07:42:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions.
[2023-11-19 07:42:25,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411196911196911
[2023-11-19 07:42:25,044 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 914 transitions.
[2023-11-19 07:42:25,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 914 transitions.
[2023-11-19 07:42:25,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:42:25,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 914 transitions.
[2023-11-19 07:42:25,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:25,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:25,053 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:25,054 INFO L175 Difference]: Start difference. First operand has 66 places, 88 transitions, 702 flow. Second operand 8 states and 914 transitions.
[2023-11-19 07:42:25,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 176 transitions, 1664 flow
[2023-11-19 07:42:25,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 176 transitions, 1596 flow, removed 12 selfloop flow, removed 3 redundant places.
[2023-11-19 07:42:25,084 INFO L231 Difference]: Finished difference. Result has 75 places, 106 transitions, 1041 flow
[2023-11-19 07:42:25,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1041, PETRI_PLACES=75, PETRI_TRANSITIONS=106}
[2023-11-19 07:42:25,085 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2023-11-19 07:42:25,085 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 106 transitions, 1041 flow
[2023-11-19 07:42:25,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:25,086 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:25,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:25,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:42:25,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:25,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1889856262, now seen corresponding path program 2 times
[2023-11-19 07:42:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:42:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968001211]
[2023-11-19 07:42:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:42:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:42:25,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:42:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:42:25,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:42:25,234 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:42:25,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-11-19 07:42:25,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-11-19 07:42:25,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-11-19 07:42:25,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-11-19 07:42:25,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-11-19 07:42:25,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-11-19 07:42:25,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-11-19 07:42:25,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-11-19 07:42:25,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-11-19 07:42:25,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-11-19 07:42:25,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-11-19 07:42:25,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-11-19 07:42:25,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-11-19 07:42:25,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:42:25,241 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:42:25,247 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:42:25,247 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:42:25,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-19 07:42:25,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:42:25,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:42:25,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0
[2023-11-19 07:42:25,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:42:25 BasicIcfg
[2023-11-19 07:42:25,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:42:25,344 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:42:25,344 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:42:25,344 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:42:25,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:05" (3/4) ...
[2023-11-19 07:42:25,347 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-19 07:42:25,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:42:25,348 INFO L158 Benchmark]: Toolchain (without parser) took 22107.36ms. Allocated memory was 140.5MB in the beginning and 813.7MB in the end (delta: 673.2MB). Free memory was 104.7MB in the beginning and 351.8MB in the end (delta: -247.1MB). Peak memory consumption was 425.6MB. Max. memory is 16.1GB.
[2023-11-19 07:42:25,349 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 115.3MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:42:25,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.97ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 81.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-19 07:42:25,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.65ms. Allocated memory is still 140.5MB. Free memory was 81.0MB in the beginning and 78.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:42:25,350 INFO L158 Benchmark]: Boogie Preprocessor took 81.85ms. Allocated memory is still 140.5MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:42:25,350 INFO L158 Benchmark]: RCFGBuilder took 1067.61ms. Allocated memory is still 140.5MB. Free memory was 76.3MB in the beginning and 73.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:42:25,351 INFO L158 Benchmark]: TraceAbstraction took 20160.30ms. Allocated memory was 140.5MB in the beginning and 813.7MB in the end (delta: 673.2MB). Free memory was 72.5MB in the beginning and 351.8MB in the end (delta: -279.3MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB.
[2023-11-19 07:42:25,351 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 813.7MB. Free memory is still 351.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:42:25,353 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.21ms. Allocated memory is still 115.3MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 702.97ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 81.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 81.65ms. Allocated memory is still 140.5MB. Free memory was 81.0MB in the beginning and 78.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 81.85ms. Allocated memory is still 140.5MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1067.61ms. Allocated memory is still 140.5MB. Free memory was 76.3MB in the beginning and 73.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 20160.30ms. Allocated memory was 140.5MB in the beginning and 813.7MB in the end (delta: 673.2MB). Free memory was 72.5MB in the beginning and 351.8MB in the end (delta: -279.3MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB.
* Witness Printer took 3.87ms. Allocated memory is still 813.7MB. Free memory is still 351.8MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable #t~nondet0
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 5.7s, 136 PlacesBefore, 43 PlacesAfterwards, 130 TransitionsBefore, 34 TransitionsAfterwards, 3068 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 126 TotalNumberOfCompositions, 8047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4064, independent: 3847, independent conditional: 0, independent unconditional: 3847, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1621, independent: 1578, independent conditional: 0, independent unconditional: 1578, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4064, independent: 2269, independent conditional: 0, independent unconditional: 2269, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 1621, unknown conditional: 0, unknown unconditional: 1621] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p1_EBX = 0;
[L715] 0 int __unbuffered_p2_EAX = 0;
[L717] 0 int __unbuffered_p2_EBX = 0;
[L719] 0 int a = 0;
[L720] 0 _Bool a$flush_delayed;
[L721] 0 int a$mem_tmp;
[L722] 0 _Bool a$r_buff0_thd0;
[L723] 0 _Bool a$r_buff0_thd1;
[L724] 0 _Bool a$r_buff0_thd2;
[L725] 0 _Bool a$r_buff0_thd3;
[L726] 0 _Bool a$r_buff1_thd0;
[L727] 0 _Bool a$r_buff1_thd1;
[L728] 0 _Bool a$r_buff1_thd2;
[L729] 0 _Bool a$r_buff1_thd3;
[L730] 0 _Bool a$read_delayed;
[L731] 0 int *a$read_delayed_var;
[L732] 0 int a$w_buff0;
[L733] 0 _Bool a$w_buff0_used;
[L734] 0 int a$w_buff1;
[L735] 0 _Bool a$w_buff1_used;
[L736] 0 _Bool main$tmp_guard0;
[L737] 0 _Bool main$tmp_guard1;
[L739] 0 int x = 0;
[L741] 0 int y = 0;
[L743] 0 int z = 0;
[L744] 0 _Bool weak$$choice0;
[L745] 0 _Bool weak$$choice2;
[L848] 0 pthread_t t281;
[L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L850] 0 pthread_t t282;
[L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L852] 0 pthread_t t283;
[L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L749] 1 a$w_buff1 = a$w_buff0
[L750] 1 a$w_buff0 = 1
[L751] 1 a$w_buff1_used = a$w_buff0_used
[L752] 1 a$w_buff0_used = (_Bool)1
[L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L758] 1 a$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L761] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L778] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L781] 2 y = 1
[L784] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L787] 2 __unbuffered_p1_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L804] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1]
[L807] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1]
[L810] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L811] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L812] 3 a$flush_delayed = weak$$choice2
[L813] 3 a$mem_tmp = a
[L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)
[L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))
[L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))
[L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))
[L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3))
[L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 __unbuffered_p2_EBX = a
[L822] 3 a = a$flush_delayed ? a$mem_tmp : a
[L823] 3 a$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1]
[L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1]
[L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1]
[L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L773] 1 return 0;
[L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1]
[L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L799] 2 return 0;
[L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L835] 3 return 0;
[L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L857] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L857] RET 0 assume_abort_if_not(main$tmp_guard0)
[L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1]
[L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L868] 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", "mix011_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 853]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 161 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1738 IncrementalHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 41 mSDtfsCounter, 1738 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=12, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-11-19 07:42:25,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:42:28,304 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:42:28,396 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2023-11-19 07:42:28,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:42:28,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:42:28,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:42:28,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:42:28,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:42:28,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:42:28,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:42:28,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:42:28,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:42:28,440 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:42:28,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:42:28,442 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:42:28,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:42:28,444 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:42:28,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:42:28,445 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 07:42:28,446 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-19 07:42:28,446 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-19 07:42:28,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:42:28,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 07:42:28,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-19 07:42:28,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-19 07:42:28,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 07:42:28,450 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:42:28,451 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:42:28,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:42:28,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:42:28,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:42:28,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:42:28,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:42:28,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:42:28,455 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-19 07:42:28,455 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-19 07:42:28,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:42:28,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:42:28,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:42:28,458 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-19 07:42:28,458 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:42:28,459 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_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b
[2023-11-19 07:42:28,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:42:28,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:42:28,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:42:28,999 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:42:29,000 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:42:29,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:42:32,291 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:42:32,719 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:42:32,720 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:42:32,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data/76b64a307/d0b18fed72e64815b1bfacc20019a563/FLAGa37cd5dc0
[2023-11-19 07:42:32,756 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/data/76b64a307/d0b18fed72e64815b1bfacc20019a563
[2023-11-19 07:42:32,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:42:32,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:42:32,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:42:32,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:42:32,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:42:32,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:32" (1/1) ...
[2023-11-19 07:42:32,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c01f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32, skipping insertion in model container
[2023-11-19 07:42:32,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:32" (1/1) ...
[2023-11-19 07:42:32,844 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:42:33,427 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:42:33,460 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:42:33,593 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:42:33,639 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:42:33,640 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:42:33,649 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:42:33,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33 WrapperNode
[2023-11-19 07:42:33,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:42:33,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:42:33,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:42:33,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:42:33,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,721 INFO L138 Inliner]: procedures = 179, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137
[2023-11-19 07:42:33,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:42:33,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:42:33,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:42:33,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:42:33,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:42:33,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:42:33,785 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:42:33,785 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:42:33,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (1/1) ...
[2023-11-19 07:42:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:42:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:42:33,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:42:33,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:42:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:42:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:42:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:42:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:42:33,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-11-19 07:42:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-11-19 07:42:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:42:33,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:42:33,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:42:33,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:42:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:42:33,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:42:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:42:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:42:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:42:33,899 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 07:42:34,099 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:42:34,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:42:34,678 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:42:34,951 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:42:34,952 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:42:34,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:34 BoogieIcfgContainer
[2023-11-19 07:42:34,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:42:34,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:42:34,965 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:42:34,969 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:42:34,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:32" (1/3) ...
[2023-11-19 07:42:34,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c6f8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:34, skipping insertion in model container
[2023-11-19 07:42:34,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:33" (2/3) ...
[2023-11-19 07:42:34,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c6f8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:34, skipping insertion in model container
[2023-11-19 07:42:34,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:34" (3/3) ...
[2023-11-19 07:42:34,976 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-19 07:42:35,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:42:35,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-19 07:42:35,001 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:42:35,107 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:42:35,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 134 transitions, 280 flow
[2023-11-19 07:42:35,261 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events.
[2023-11-19 07:42:35,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:35,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 4/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place.
[2023-11-19 07:42:35,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 134 transitions, 280 flow
[2023-11-19 07:42:35,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 131 transitions, 271 flow
[2023-11-19 07:42:35,281 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:42:35,292 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 131 transitions, 271 flow
[2023-11-19 07:42:35,296 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 131 transitions, 271 flow
[2023-11-19 07:42:35,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 131 transitions, 271 flow
[2023-11-19 07:42:35,335 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events.
[2023-11-19 07:42:35,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:35,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 4/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place.
[2023-11-19 07:42:35,341 INFO L119 LiptonReduction]: Number of co-enabled transitions 3068
[2023-11-19 07:42:44,274 INFO L134 LiptonReduction]: Checked pairs total: 8600
[2023-11-19 07:42:44,275 INFO L136 LiptonReduction]: Total number of compositions: 129
[2023-11-19 07:42:44,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:42:44,300 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;@3fa8bca5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:42:44,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-19 07:42:44,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:42:44,302 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events.
[2023-11-19 07:42:44,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:42:44,303 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:42:44,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-11-19 07:42:44,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:42:44,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:42:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times
[2023-11-19 07:42:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 07:42:44,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403779898]
[2023-11-19 07:42:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:42:44,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-19 07:42:44,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 07:42:44,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-11-19 07:42:44,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1adda0b8-437f-4540-9444-1042a317d569/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-11-19 07:42:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:42:44,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-11-19 07:42:44,444 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:42:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:42:44,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:42:44,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 07:42:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403779898]
[2023-11-19 07:42:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403779898] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:42:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:42:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-19 07:42:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294533744]
[2023-11-19 07:42:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:42:44,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 07:42:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 07:42:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 07:42:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:42:44,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 263
[2023-11-19 07:42:44,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:42:44,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:42:44,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 263
[2023-11-19 07:42:44,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand