./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:55:31,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:55:31,372 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:55:31,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:55:31,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:55:31,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:55:31,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:55:31,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:55:31,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:55:31,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:55:31,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:55:31,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:55:31,434 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:55:31,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:55:31,437 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:55:31,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:55:31,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:55:31,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:55:31,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:55:31,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:55:31,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:55:31,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:55:31,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:55:31,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:55:31,443 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:55:31,444 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:55:31,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:55:31,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:55:31,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:55:31,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:55:31,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:55:31,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:55:31,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:55:31,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:55:31,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:55:31,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:55:31,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:55:31,450 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:55:31,450 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_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/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_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2023-11-06 22:55:31,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:55:31,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:55:31,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:55:31,766 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:55:31,767 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:55:31,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread/queue_ok.i [2023-11-06 22:55:34,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:55:35,319 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:55:35,320 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/sv-benchmarks/c/pthread/queue_ok.i [2023-11-06 22:55:35,345 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/data/a8933879b/7cb39d0d5f604be38114361e03cc34a2/FLAG9e5bef6f3 [2023-11-06 22:55:35,364 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/data/a8933879b/7cb39d0d5f604be38114361e03cc34a2 [2023-11-06 22:55:35,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:55:35,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:55:35,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:55:35,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:55:35,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:55:35,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:35" (1/1) ... [2023-11-06 22:55:35,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1533f832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:35, skipping insertion in model container [2023-11-06 22:55:35,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:35" (1/1) ... [2023-11-06 22:55:35,452 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:55:35,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:55:36,008 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:55:36,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:55:36,175 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:55:36,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36 WrapperNode [2023-11-06 22:55:36,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:55:36,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:55:36,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:55:36,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:55:36,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,249 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2023-11-06 22:55:36,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:55:36,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:55:36,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:55:36,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:55:36,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:55:36,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:55:36,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:55:36,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:55:36,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (1/1) ... [2023-11-06 22:55:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:55:36,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:36,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:55:36,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:55:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-06 22:55:36,420 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-06 22:55:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-06 22:55:36,422 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-06 22:55:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:55:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:55:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:55:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:55:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:55:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:55:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:55:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:55:36,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:55:36,426 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:55:36,646 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:55:36,649 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:55:37,248 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:55:37,265 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:55:37,268 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:55:37,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:37 BoogieIcfgContainer [2023-11-06 22:55:37,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:55:37,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:55:37,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:55:37,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:55:37,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:55:35" (1/3) ... [2023-11-06 22:55:37,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23688b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:37, skipping insertion in model container [2023-11-06 22:55:37,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:36" (2/3) ... [2023-11-06 22:55:37,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23688b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:37, skipping insertion in model container [2023-11-06 22:55:37,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:37" (3/3) ... [2023-11-06 22:55:37,289 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-06 22:55:37,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:55:37,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-06 22:55:37,313 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:55:37,528 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 22:55:37,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 298 transitions, 610 flow [2023-11-06 22:55:37,783 INFO L124 PetriNetUnfolderBase]: 15/296 cut-off events. [2023-11-06 22:55:37,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:55:37,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 296 events. 15/296 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 704 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 196. Up to 3 conditions per place. [2023-11-06 22:55:37,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 298 transitions, 610 flow [2023-11-06 22:55:37,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 291 transitions, 594 flow [2023-11-06 22:55:37,818 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:55:37,837 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 291 transitions, 594 flow [2023-11-06 22:55:37,840 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 291 transitions, 594 flow [2023-11-06 22:55:37,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 291 transitions, 594 flow [2023-11-06 22:55:37,938 INFO L124 PetriNetUnfolderBase]: 15/291 cut-off events. [2023-11-06 22:55:37,939 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:55:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 291 events. 15/291 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 686 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 196. Up to 3 conditions per place. [2023-11-06 22:55:37,958 INFO L119 LiptonReduction]: Number of co-enabled transitions 19748 [2023-11-06 22:55:55,130 INFO L134 LiptonReduction]: Checked pairs total: 61464 [2023-11-06 22:55:55,130 INFO L136 LiptonReduction]: Total number of compositions: 393 [2023-11-06 22:55:55,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:55:55,155 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;@193bdea3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:55:55,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-06 22:55:55,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:55:55,157 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:55:55,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:55:55,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:55:55,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:55:55,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:55:55,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1256, now seen corresponding path program 1 times [2023-11-06 22:55:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645136061] [2023-11-06 22:55:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:55,298 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-06 22:55:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645136061] [2023-11-06 22:55:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645136061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:55,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:55:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222525935] [2023-11-06 22:55:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:55,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:55:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:55,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:55:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:55:55,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 691 [2023-11-06 22:55:55,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 285.5) internal successors, (571), 2 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:55,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:55:55,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 691 [2023-11-06 22:55:55,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:55:56,386 INFO L124 PetriNetUnfolderBase]: 4087/6349 cut-off events. [2023-11-06 22:55:56,387 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-06 22:55:56,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12655 conditions, 6349 events. 4087/6349 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 35186 event pairs, 3451 based on Foata normal form. 0/3225 useless extension candidates. Maximal degree in co-relation 12174. Up to 6236 conditions per place. [2023-11-06 22:55:56,438 INFO L140 encePairwiseOnDemand]: 655/691 looper letters, 63 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-11-06 22:55:56,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 278 flow [2023-11-06 22:55:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:55:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:55:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 669 transitions. [2023-11-06 22:55:56,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4840810419681621 [2023-11-06 22:55:56,456 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 669 transitions. [2023-11-06 22:55:56,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 669 transitions. [2023-11-06 22:55:56,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:55:56,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 669 transitions. [2023-11-06 22:55:56,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 334.5) internal successors, (669), 2 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:56,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 691.0) internal successors, (2073), 3 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:56,476 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 691.0) internal successors, (2073), 3 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:56,479 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 669 transitions. [2023-11-06 22:55:56,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 278 flow [2023-11-06 22:55:56,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:55:56,486 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-11-06 22:55:56,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-11-06 22:55:56,492 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-11-06 22:55:56,492 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-11-06 22:55:56,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 285.5) internal successors, (571), 2 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:56,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:55:56,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:55:56,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:55:56,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:55:56,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1245768, now seen corresponding path program 1 times [2023-11-06 22:55:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:56,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243632988] [2023-11-06 22:55:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:56,754 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-06 22:55:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243632988] [2023-11-06 22:55:56,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243632988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:56,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:56,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:55:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462406990] [2023-11-06 22:55:56,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:56,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:55:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:56,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:55:56,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:55:56,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 691 [2023-11-06 22:55:56,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:56,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:55:56,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 691 [2023-11-06 22:55:56,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:55:57,758 INFO L124 PetriNetUnfolderBase]: 4037/6251 cut-off events. [2023-11-06 22:55:57,759 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:55:57,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 6251 events. 4037/6251 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 34392 event pairs, 3408 based on Foata normal form. 0/3195 useless extension candidates. Maximal degree in co-relation 12411. Up to 6139 conditions per place. [2023-11-06 22:55:57,812 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 59 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-06 22:55:57,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 262 flow [2023-11-06 22:55:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:55:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:55:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2023-11-06 22:55:57,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283646888567294 [2023-11-06 22:55:57,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 888 transitions. [2023-11-06 22:55:57,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 888 transitions. [2023-11-06 22:55:57,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:55:57,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 888 transitions. [2023-11-06 22:55:57,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:57,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:57,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:57,832 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 888 transitions. [2023-11-06 22:55:57,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 262 flow [2023-11-06 22:55:57,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:55:57,837 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-11-06 22:55:57,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-11-06 22:55:57,842 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-11-06 22:55:57,842 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-11-06 22:55:57,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:57,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:55:57,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:55:57,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:55:57,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:55:57,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769, now seen corresponding path program 1 times [2023-11-06 22:55:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141731871] [2023-11-06 22:55:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:58,093 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-06 22:55:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:58,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141731871] [2023-11-06 22:55:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141731871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:58,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:55:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128092982] [2023-11-06 22:55:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:58,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:55:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:55:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:55:58,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 691 [2023-11-06 22:55:58,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:58,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:55:58,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 691 [2023-11-06 22:55:58,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:55:59,133 INFO L124 PetriNetUnfolderBase]: 3987/6153 cut-off events. [2023-11-06 22:55:59,133 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:55:59,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12224 conditions, 6153 events. 3987/6153 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 33652 event pairs, 3365 based on Foata normal form. 0/3165 useless extension candidates. Maximal degree in co-relation 12220. Up to 6044 conditions per place. [2023-11-06 22:55:59,180 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 57 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-06 22:55:59,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 258 flow [2023-11-06 22:55:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:55:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:55:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2023-11-06 22:55:59,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331886155330439 [2023-11-06 22:55:59,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 898 transitions. [2023-11-06 22:55:59,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 898 transitions. [2023-11-06 22:55:59,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:55:59,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 898 transitions. [2023-11-06 22:55:59,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:59,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:59,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:59,199 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 898 transitions. [2023-11-06 22:55:59,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 258 flow [2023-11-06 22:55:59,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:55:59,202 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-11-06 22:55:59,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-11-06 22:55:59,203 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-11-06 22:55:59,203 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-11-06 22:55:59,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:59,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:55:59,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:55:59,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:55:59,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:55:59,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1197200326, now seen corresponding path program 1 times [2023-11-06 22:55:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329111890] [2023-11-06 22:55:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:59,610 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-06 22:55:59,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:59,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329111890] [2023-11-06 22:55:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329111890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:55:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410577640] [2023-11-06 22:55:59,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:59,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:55:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:59,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:55:59,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:55:59,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 691 [2023-11-06 22:55:59,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:59,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:55:59,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 691 [2023-11-06 22:55:59,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:00,637 INFO L124 PetriNetUnfolderBase]: 4093/6374 cut-off events. [2023-11-06 22:56:00,638 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:56:00,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12666 conditions, 6374 events. 4093/6374 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 35289 event pairs, 2902 based on Foata normal form. 0/3181 useless extension candidates. Maximal degree in co-relation 12662. Up to 6257 conditions per place. [2023-11-06 22:56:00,678 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 66 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2023-11-06 22:56:00,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 300 flow [2023-11-06 22:56:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2023-11-06 22:56:00,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43077665219488664 [2023-11-06 22:56:00,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions. [2023-11-06 22:56:00,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions. [2023-11-06 22:56:00,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:00,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions. [2023-11-06 22:56:00,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:00,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:00,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:00,695 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 893 transitions. [2023-11-06 22:56:00,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 300 flow [2023-11-06 22:56:00,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:00,700 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 162 flow [2023-11-06 22:56:00,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-11-06 22:56:00,703 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-11-06 22:56:00,703 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 162 flow [2023-11-06 22:56:00,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:00,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:00,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:56:00,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:56:00,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:00,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1197200323, now seen corresponding path program 1 times [2023-11-06 22:56:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263357492] [2023-11-06 22:56:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:00,946 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-06 22:56:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263357492] [2023-11-06 22:56:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263357492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998921168] [2023-11-06 22:56:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:00,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:00,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:00,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:01,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 691 [2023-11-06 22:56:01,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:01,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:01,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 691 [2023-11-06 22:56:01,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:01,786 INFO L124 PetriNetUnfolderBase]: 3390/5227 cut-off events. [2023-11-06 22:56:01,788 INFO L125 PetriNetUnfolderBase]: For 224/311 co-relation queries the response was YES. [2023-11-06 22:56:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10604 conditions, 5227 events. 3390/5227 cut-off events. For 224/311 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 27689 event pairs, 2802 based on Foata normal form. 0/2961 useless extension candidates. Maximal degree in co-relation 10599. Up to 5126 conditions per place. [2023-11-06 22:56:01,832 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 56 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2023-11-06 22:56:01,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 268 flow [2023-11-06 22:56:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2023-11-06 22:56:01,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380125422093584 [2023-11-06 22:56:01,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 908 transitions. [2023-11-06 22:56:01,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 908 transitions. [2023-11-06 22:56:01,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:01,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 908 transitions. [2023-11-06 22:56:01,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:01,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:01,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:01,851 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 162 flow. Second operand 3 states and 908 transitions. [2023-11-06 22:56:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 268 flow [2023-11-06 22:56:01,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:01,854 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 152 flow [2023-11-06 22:56:01,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-11-06 22:56:01,855 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-11-06 22:56:01,855 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 152 flow [2023-11-06 22:56:01,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:01,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:01,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:56:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:56:01,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:01,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1197200324, now seen corresponding path program 1 times [2023-11-06 22:56:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656214943] [2023-11-06 22:56:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:01,990 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-06 22:56:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656214943] [2023-11-06 22:56:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656214943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:01,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:01,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:01,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193804299] [2023-11-06 22:56:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:01,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:01,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:02,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 691 [2023-11-06 22:56:02,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:02,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:02,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 691 [2023-11-06 22:56:02,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:02,690 INFO L124 PetriNetUnfolderBase]: 2956/4550 cut-off events. [2023-11-06 22:56:02,690 INFO L125 PetriNetUnfolderBase]: For 204/283 co-relation queries the response was YES. [2023-11-06 22:56:02,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9232 conditions, 4550 events. 2956/4550 cut-off events. For 204/283 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 23354 event pairs, 2409 based on Foata normal form. 0/2720 useless extension candidates. Maximal degree in co-relation 9227. Up to 4457 conditions per place. [2023-11-06 22:56:02,725 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 52 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-06 22:56:02,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 254 flow [2023-11-06 22:56:02,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2023-11-06 22:56:02,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43463579353593823 [2023-11-06 22:56:02,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 901 transitions. [2023-11-06 22:56:02,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 901 transitions. [2023-11-06 22:56:02,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:02,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 901 transitions. [2023-11-06 22:56:02,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:02,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:02,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:02,742 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 152 flow. Second operand 3 states and 901 transitions. [2023-11-06 22:56:02,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 254 flow [2023-11-06 22:56:02,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:02,745 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 149 flow [2023-11-06 22:56:02,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2023-11-06 22:56:02,746 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-11-06 22:56:02,746 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 149 flow [2023-11-06 22:56:02,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:02,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:02,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:56:02,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:56:02,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:02,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1197212170, now seen corresponding path program 1 times [2023-11-06 22:56:02,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:02,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165423340] [2023-11-06 22:56:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:02,852 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-06 22:56:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165423340] [2023-11-06 22:56:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165423340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217352133] [2023-11-06 22:56:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:03,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 691 [2023-11-06 22:56:03,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 278.25) internal successors, (1113), 4 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:03,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 691 [2023-11-06 22:56:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:03,533 INFO L124 PetriNetUnfolderBase]: 2149/3368 cut-off events. [2023-11-06 22:56:03,533 INFO L125 PetriNetUnfolderBase]: For 162/221 co-relation queries the response was YES. [2023-11-06 22:56:03,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 3368 events. 2149/3368 cut-off events. For 162/221 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16777 event pairs, 1733 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 6841. Up to 3293 conditions per place. [2023-11-06 22:56:03,558 INFO L140 encePairwiseOnDemand]: 688/691 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-06 22:56:03,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 253 flow [2023-11-06 22:56:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2023-11-06 22:56:03,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4259527255185721 [2023-11-06 22:56:03,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2023-11-06 22:56:03,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2023-11-06 22:56:03,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:03,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2023-11-06 22:56:03,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:03,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:03,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:03,576 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 149 flow. Second operand 3 states and 883 transitions. [2023-11-06 22:56:03,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 253 flow [2023-11-06 22:56:03,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:03,580 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 147 flow [2023-11-06 22:56:03,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2023-11-06 22:56:03,581 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -46 predicate places. [2023-11-06 22:56:03,582 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 147 flow [2023-11-06 22:56:03,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.25) internal successors, (1113), 4 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:03,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:03,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:56:03,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:56:03,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:03,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1197212169, now seen corresponding path program 1 times [2023-11-06 22:56:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058504196] [2023-11-06 22:56:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:03,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:03,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058504196] [2023-11-06 22:56:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058504196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:03,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:03,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611985211] [2023-11-06 22:56:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:03,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:03,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 691 [2023-11-06 22:56:03,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 272.25) internal successors, (1089), 4 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:03,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:03,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 691 [2023-11-06 22:56:03,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:04,236 INFO L124 PetriNetUnfolderBase]: 1342/2186 cut-off events. [2023-11-06 22:56:04,237 INFO L125 PetriNetUnfolderBase]: For 120/159 co-relation queries the response was YES. [2023-11-06 22:56:04,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4458 conditions, 2186 events. 1342/2186 cut-off events. For 120/159 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 10525 event pairs, 1057 based on Foata normal form. 0/1616 useless extension candidates. Maximal degree in co-relation 4453. Up to 2129 conditions per place. [2023-11-06 22:56:04,251 INFO L140 encePairwiseOnDemand]: 688/691 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-06 22:56:04,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 249 flow [2023-11-06 22:56:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2023-11-06 22:56:04,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41678726483357453 [2023-11-06 22:56:04,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 864 transitions. [2023-11-06 22:56:04,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 864 transitions. [2023-11-06 22:56:04,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:04,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 864 transitions. [2023-11-06 22:56:04,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:04,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:04,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:04,266 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 147 flow. Second operand 3 states and 864 transitions. [2023-11-06 22:56:04,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 249 flow [2023-11-06 22:56:04,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:04,269 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 145 flow [2023-11-06 22:56:04,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2023-11-06 22:56:04,272 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2023-11-06 22:56:04,272 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 145 flow [2023-11-06 22:56:04,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 272.25) internal successors, (1089), 4 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:04,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:04,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:56:04,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:56:04,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:04,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1541341198, now seen corresponding path program 1 times [2023-11-06 22:56:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011942921] [2023-11-06 22:56:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:04,795 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-06 22:56:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011942921] [2023-11-06 22:56:04,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011942921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037115322] [2023-11-06 22:56:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:05,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 691 [2023-11-06 22:56:05,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:05,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:05,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 691 [2023-11-06 22:56:05,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:05,655 INFO L124 PetriNetUnfolderBase]: 1730/2853 cut-off events. [2023-11-06 22:56:05,655 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-11-06 22:56:05,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 2853 events. 1730/2853 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14970 event pairs, 389 based on Foata normal form. 27/2131 useless extension candidates. Maximal degree in co-relation 5835. Up to 2268 conditions per place. [2023-11-06 22:56:05,671 INFO L140 encePairwiseOnDemand]: 685/691 looper letters, 74 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2023-11-06 22:56:05,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 370 flow [2023-11-06 22:56:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1156 transitions. [2023-11-06 22:56:05,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182344428364689 [2023-11-06 22:56:05,677 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1156 transitions. [2023-11-06 22:56:05,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1156 transitions. [2023-11-06 22:56:05,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:05,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1156 transitions. [2023-11-06 22:56:05,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:05,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:05,690 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:05,690 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 145 flow. Second operand 4 states and 1156 transitions. [2023-11-06 22:56:05,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 370 flow [2023-11-06 22:56:05,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:05,694 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 184 flow [2023-11-06 22:56:05,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2023-11-06 22:56:05,695 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-11-06 22:56:05,695 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 184 flow [2023-11-06 22:56:05,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:05,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:05,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:56:05,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:56:05,697 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:05,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1541494502, now seen corresponding path program 1 times [2023-11-06 22:56:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:05,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669363931] [2023-11-06 22:56:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:05,883 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-06 22:56:05,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:05,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669363931] [2023-11-06 22:56:05,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669363931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:05,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:05,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900814504] [2023-11-06 22:56:05,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:06,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 691 [2023-11-06 22:56:06,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:06,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 691 [2023-11-06 22:56:06,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:06,566 INFO L124 PetriNetUnfolderBase]: 1521/2548 cut-off events. [2023-11-06 22:56:06,566 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2023-11-06 22:56:06,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5297 conditions, 2548 events. 1521/2548 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13573 event pairs, 740 based on Foata normal form. 72/2070 useless extension candidates. Maximal degree in co-relation 5291. Up to 1476 conditions per place. [2023-11-06 22:56:06,584 INFO L140 encePairwiseOnDemand]: 684/691 looper letters, 74 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-11-06 22:56:06,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 386 flow [2023-11-06 22:56:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1164 transitions. [2023-11-06 22:56:06,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4211287988422576 [2023-11-06 22:56:06,590 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1164 transitions. [2023-11-06 22:56:06,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1164 transitions. [2023-11-06 22:56:06,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:06,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1164 transitions. [2023-11-06 22:56:06,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,603 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,603 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 184 flow. Second operand 4 states and 1164 transitions. [2023-11-06 22:56:06,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 386 flow [2023-11-06 22:56:06,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:06,608 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 168 flow [2023-11-06 22:56:06,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-06 22:56:06,609 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-11-06 22:56:06,609 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 168 flow [2023-11-06 22:56:06,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:06,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:06,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:56:06,610 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:06,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1471121744, now seen corresponding path program 1 times [2023-11-06 22:56:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787825762] [2023-11-06 22:56:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:06,714 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-06 22:56:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787825762] [2023-11-06 22:56:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787825762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477087745] [2023-11-06 22:56:06,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:06,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:06,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 691 [2023-11-06 22:56:06,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:06,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 691 [2023-11-06 22:56:06,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:06,960 INFO L124 PetriNetUnfolderBase]: 431/858 cut-off events. [2023-11-06 22:56:06,960 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-11-06 22:56:06,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 858 events. 431/858 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4359 event pairs, 262 based on Foata normal form. 38/781 useless extension candidates. Maximal degree in co-relation 1811. Up to 435 conditions per place. [2023-11-06 22:56:06,966 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 61 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-11-06 22:56:06,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 332 flow [2023-11-06 22:56:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 900 transitions. [2023-11-06 22:56:06,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4341534008683068 [2023-11-06 22:56:06,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 900 transitions. [2023-11-06 22:56:06,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 900 transitions. [2023-11-06 22:56:06,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:06,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 900 transitions. [2023-11-06 22:56:06,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,983 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 168 flow. Second operand 3 states and 900 transitions. [2023-11-06 22:56:06,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 332 flow [2023-11-06 22:56:06,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:06,986 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 169 flow [2023-11-06 22:56:06,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-06 22:56:06,987 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-11-06 22:56:06,987 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 169 flow [2023-11-06 22:56:06,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:06,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:06,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:06,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:56:06,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:06,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1024067660, now seen corresponding path program 1 times [2023-11-06 22:56:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048762636] [2023-11-06 22:56:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:07,265 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-06 22:56:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:07,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048762636] [2023-11-06 22:56:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048762636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:07,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:07,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700199591] [2023-11-06 22:56:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:07,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:07,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 691 [2023-11-06 22:56:07,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:07,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:07,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 691 [2023-11-06 22:56:07,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:07,787 INFO L124 PetriNetUnfolderBase]: 384/771 cut-off events. [2023-11-06 22:56:07,787 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-06 22:56:07,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 771 events. 384/771 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3604 event pairs, 246 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 1631. Up to 555 conditions per place. [2023-11-06 22:56:07,792 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 63 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-11-06 22:56:07,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 334 flow [2023-11-06 22:56:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1181 transitions. [2023-11-06 22:56:07,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4272793053545586 [2023-11-06 22:56:07,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1181 transitions. [2023-11-06 22:56:07,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1181 transitions. [2023-11-06 22:56:07,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:07,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1181 transitions. [2023-11-06 22:56:07,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 295.25) internal successors, (1181), 4 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:07,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:07,808 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 691.0) internal successors, (3455), 5 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:07,809 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 169 flow. Second operand 4 states and 1181 transitions. [2023-11-06 22:56:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 334 flow [2023-11-06 22:56:07,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 326 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:07,812 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 173 flow [2023-11-06 22:56:07,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2023-11-06 22:56:07,813 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-11-06 22:56:07,814 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 173 flow [2023-11-06 22:56:07,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:07,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:07,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:07,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:56:07,815 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:07,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1024067661, now seen corresponding path program 1 times [2023-11-06 22:56:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920869920] [2023-11-06 22:56:07,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:07,919 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-06 22:56:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920869920] [2023-11-06 22:56:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920869920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:07,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:07,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812244595] [2023-11-06 22:56:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:07,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:07,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:07,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:08,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 691 [2023-11-06 22:56:08,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:08,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:08,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 691 [2023-11-06 22:56:08,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:08,213 INFO L124 PetriNetUnfolderBase]: 360/724 cut-off events. [2023-11-06 22:56:08,213 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-11-06 22:56:08,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 724 events. 360/724 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3333 event pairs, 298 based on Foata normal form. 16/661 useless extension candidates. Maximal degree in co-relation 1552. Up to 668 conditions per place. [2023-11-06 22:56:08,218 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-11-06 22:56:08,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 267 flow [2023-11-06 22:56:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2023-11-06 22:56:08,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42547033285094066 [2023-11-06 22:56:08,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 882 transitions. [2023-11-06 22:56:08,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 882 transitions. [2023-11-06 22:56:08,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:08,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 882 transitions. [2023-11-06 22:56:08,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:08,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:08,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:08,232 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 173 flow. Second operand 3 states and 882 transitions. [2023-11-06 22:56:08,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 267 flow [2023-11-06 22:56:08,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:08,235 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 171 flow [2023-11-06 22:56:08,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-06 22:56:08,236 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-11-06 22:56:08,237 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 171 flow [2023-11-06 22:56:08,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:08,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:08,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:08,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:56:08,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:08,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:08,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1681325168, now seen corresponding path program 1 times [2023-11-06 22:56:08,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:08,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895801053] [2023-11-06 22:56:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:08,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895801053] [2023-11-06 22:56:08,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895801053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431002781] [2023-11-06 22:56:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:08,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:08,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 691 [2023-11-06 22:56:08,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:08,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:08,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 691 [2023-11-06 22:56:08,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:09,214 INFO L124 PetriNetUnfolderBase]: 374/738 cut-off events. [2023-11-06 22:56:09,214 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-11-06 22:56:09,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 738 events. 374/738 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3366 event pairs, 292 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 1601. Up to 690 conditions per place. [2023-11-06 22:56:09,219 INFO L140 encePairwiseOnDemand]: 684/691 looper letters, 55 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-11-06 22:56:09,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 331 flow [2023-11-06 22:56:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1670 transitions. [2023-11-06 22:56:09,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027978774722624 [2023-11-06 22:56:09,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1670 transitions. [2023-11-06 22:56:09,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1670 transitions. [2023-11-06 22:56:09,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:09,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1670 transitions. [2023-11-06 22:56:09,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 278.3333333333333) internal successors, (1670), 6 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:09,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 691.0) internal successors, (4837), 7 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:09,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 691.0) internal successors, (4837), 7 states have internal predecessors, (4837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:09,243 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 171 flow. Second operand 6 states and 1670 transitions. [2023-11-06 22:56:09,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 331 flow [2023-11-06 22:56:09,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:09,246 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 220 flow [2023-11-06 22:56:09,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2023-11-06 22:56:09,247 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-11-06 22:56:09,247 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 220 flow [2023-11-06 22:56:09,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:09,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:09,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:09,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:56:09,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:09,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 847883346, now seen corresponding path program 1 times [2023-11-06 22:56:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141969721] [2023-11-06 22:56:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:09,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141969721] [2023-11-06 22:56:09,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141969721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:09,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:09,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:56:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505865151] [2023-11-06 22:56:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:09,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:56:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:56:09,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:56:10,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 691 [2023-11-06 22:56:10,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 260.85714285714283) internal successors, (1826), 7 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:10,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:10,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 691 [2023-11-06 22:56:10,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:11,149 INFO L124 PetriNetUnfolderBase]: 422/828 cut-off events. [2023-11-06 22:56:11,149 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-11-06 22:56:11,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 828 events. 422/828 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3882 event pairs, 107 based on Foata normal form. 7/773 useless extension candidates. Maximal degree in co-relation 1912. Up to 612 conditions per place. [2023-11-06 22:56:11,154 INFO L140 encePairwiseOnDemand]: 683/691 looper letters, 71 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2023-11-06 22:56:11,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 460 flow [2023-11-06 22:56:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:56:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:56:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1894 transitions. [2023-11-06 22:56:11,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3915650196402729 [2023-11-06 22:56:11,164 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1894 transitions. [2023-11-06 22:56:11,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1894 transitions. [2023-11-06 22:56:11,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:11,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1894 transitions. [2023-11-06 22:56:11,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 270.57142857142856) internal successors, (1894), 7 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:11,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 691.0) internal successors, (5528), 8 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:11,222 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 691.0) internal successors, (5528), 8 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:11,222 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 220 flow. Second operand 7 states and 1894 transitions. [2023-11-06 22:56:11,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 460 flow [2023-11-06 22:56:11,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 452 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:11,226 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 282 flow [2023-11-06 22:56:11,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-11-06 22:56:11,227 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -31 predicate places. [2023-11-06 22:56:11,227 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 282 flow [2023-11-06 22:56:11,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 260.85714285714283) internal successors, (1826), 7 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:11,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:11,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:11,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:56:11,228 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:11,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash -463727236, now seen corresponding path program 2 times [2023-11-06 22:56:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382481756] [2023-11-06 22:56:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382481756] [2023-11-06 22:56:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382481756] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123653037] [2023-11-06 22:56:11,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:56:11,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:11,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:11,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:56:11,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:56:11,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:56:11,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:56:11,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:12,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:56:12,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:12,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:56:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:12,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:12,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-11-06 22:56:12,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:12,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-06 22:56:12,252 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:12,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-06 22:56:12,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 22:56:12,278 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:12,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-06 22:56:12,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:56:12,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:12,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:56:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123653037] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:56:12,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:56:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-11-06 22:56:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866169739] [2023-11-06 22:56:12,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:56:12,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:56:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:56:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=152, Unknown=2, NotChecked=0, Total=210 [2023-11-06 22:56:13,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 691 [2023-11-06 22:56:13,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 282 flow. Second operand has 15 states, 15 states have (on average 193.6) internal successors, (2904), 15 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:13,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:13,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 691 [2023-11-06 22:56:13,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:14,223 INFO L124 PetriNetUnfolderBase]: 591/1184 cut-off events. [2023-11-06 22:56:14,224 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2023-11-06 22:56:14,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 1184 events. 591/1184 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6371 event pairs, 219 based on Foata normal form. 8/1094 useless extension candidates. Maximal degree in co-relation 2854. Up to 445 conditions per place. [2023-11-06 22:56:14,233 INFO L140 encePairwiseOnDemand]: 681/691 looper letters, 93 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2023-11-06 22:56:14,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 680 flow [2023-11-06 22:56:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:56:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:56:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2015 transitions. [2023-11-06 22:56:14,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29160636758321273 [2023-11-06 22:56:14,245 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2015 transitions. [2023-11-06 22:56:14,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2015 transitions. [2023-11-06 22:56:14,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:14,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2015 transitions. [2023-11-06 22:56:14,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 201.5) internal successors, (2015), 10 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:14,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 691.0) internal successors, (7601), 11 states have internal predecessors, (7601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:14,269 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 691.0) internal successors, (7601), 11 states have internal predecessors, (7601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:14,269 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 282 flow. Second operand 10 states and 2015 transitions. [2023-11-06 22:56:14,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 680 flow [2023-11-06 22:56:14,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 122 transitions, 657 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:14,276 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 376 flow [2023-11-06 22:56:14,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=376, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2023-11-06 22:56:14,276 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -20 predicate places. [2023-11-06 22:56:14,277 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 376 flow [2023-11-06 22:56:14,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 193.6) internal successors, (2904), 15 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:14,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:14,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:14,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:56:14,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:56:14,486 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:14,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -587706807, now seen corresponding path program 1 times [2023-11-06 22:56:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595468281] [2023-11-06 22:56:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595468281] [2023-11-06 22:56:15,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595468281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:15,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927764611] [2023-11-06 22:56:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:15,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:15,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:15,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:56:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:16,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:56:16,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:16,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:16,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:56:16,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:16,102 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:56:16,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:16,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:16,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:56:16,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-06 22:56:16,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-06 22:56:16,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2023-11-06 22:56:16,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:16,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2023-11-06 22:56:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:16,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:16,921 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_353 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_353) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_353 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_353) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-11-06 22:56:18,277 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:18,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2023-11-06 22:56:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927764611] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:56:19,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:56:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2023-11-06 22:56:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398534642] [2023-11-06 22:56:19,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:56:19,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:56:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:56:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=377, Unknown=29, NotChecked=42, Total=552 [2023-11-06 22:56:20,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 691 [2023-11-06 22:56:20,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 376 flow. Second operand has 24 states, 24 states have (on average 189.625) internal successors, (4551), 24 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:20,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:20,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 691 [2023-11-06 22:56:20,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:24,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:26,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:29,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:31,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:33,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:35,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:38,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:40,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:43,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:56:43,390 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse8 .cse4)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1))) (and (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ v_prenex_1 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse4) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| Int) (v_ArrVal_353 (Array Int Int)) (v_ArrVal_348 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_348))) (store (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| 1)) .cse4 (+ (select .cse6 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_353) |c_~#queue~0.base|) .cse4) 23)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_ArrVal_348 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_348))) (store (store .cse9 .cse7 (+ v_prenex_1 1)) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_prenex_2) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| Int) (v_ArrVal_353 (Array Int Int))) (< (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_116| 1)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_353) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|) (+ 89 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (forall ((v_ArrVal_353 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_353) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_353 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_353) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2023-11-06 22:56:45,477 INFO L124 PetriNetUnfolderBase]: 608/1223 cut-off events. [2023-11-06 22:56:45,477 INFO L125 PetriNetUnfolderBase]: For 950/950 co-relation queries the response was YES. [2023-11-06 22:56:45,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1223 events. 608/1223 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6591 event pairs, 466 based on Foata normal form. 2/1139 useless extension candidates. Maximal degree in co-relation 3221. Up to 1118 conditions per place. [2023-11-06 22:56:45,492 INFO L140 encePairwiseOnDemand]: 679/691 looper letters, 74 selfloop transitions, 30 changer transitions 0/110 dead transitions. [2023-11-06 22:56:45,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 796 flow [2023-11-06 22:56:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:56:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:56:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3098 transitions. [2023-11-06 22:56:45,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28020984081041966 [2023-11-06 22:56:45,508 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3098 transitions. [2023-11-06 22:56:45,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3098 transitions. [2023-11-06 22:56:45,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:45,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3098 transitions. [2023-11-06 22:56:45,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 193.625) internal successors, (3098), 16 states have internal predecessors, (3098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:45,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 691.0) internal successors, (11747), 17 states have internal predecessors, (11747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:45,539 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 691.0) internal successors, (11747), 17 states have internal predecessors, (11747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:45,540 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 376 flow. Second operand 16 states and 3098 transitions. [2023-11-06 22:56:45,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 796 flow [2023-11-06 22:56:45,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 110 transitions, 760 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:45,549 INFO L231 Difference]: Finished difference. Result has 104 places, 96 transitions, 611 flow [2023-11-06 22:56:45,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=611, PETRI_PLACES=104, PETRI_TRANSITIONS=96} [2023-11-06 22:56:45,550 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -2 predicate places. [2023-11-06 22:56:45,550 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 96 transitions, 611 flow [2023-11-06 22:56:45,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 189.625) internal successors, (4551), 24 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:45,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:45,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:45,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:56:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:56:45,759 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:56:45,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 508345799, now seen corresponding path program 1 times [2023-11-06 22:56:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419598347] [2023-11-06 22:56:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419598347] [2023-11-06 22:56:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419598347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328781989] [2023-11-06 22:56:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:47,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:47,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:47,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:56:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:47,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:56:47,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:47,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:47,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:47,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:56:47,420 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-06 22:56:47,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-06 22:56:47,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:47,477 INFO L322 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-06 22:56:47,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2023-11-06 22:56:47,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:47,501 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:56:47,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:56:47,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-06 22:56:48,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-06 22:56:48,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2023-11-06 22:56:48,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:48,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2023-11-06 22:56:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:48,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:48,846 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_417 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_417 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 22:56:48,872 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_417 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_417 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 22:56:50,532 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:50,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2023-11-06 22:57:08,446 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_411))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_412 Int) (v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_412))) (store (store .cse1 .cse2 (+ v_prenex_4 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_3) |c_~#queue~0.base|) .cse3) 23)) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_411))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_412 Int) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| Int)) (<= 0 (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_412))) (store (store .cse6 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_122| 1)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|))))))) is different from false [2023-11-06 22:57:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328781989] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:57:08,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:57:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2023-11-06 22:57:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393049099] [2023-11-06 22:57:08,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:57:08,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:57:08,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:57:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=434, Unknown=20, NotChecked=138, Total=702 [2023-11-06 22:57:09,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 691 [2023-11-06 22:57:09,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 96 transitions, 611 flow. Second operand has 27 states, 27 states have (on average 183.55555555555554) internal successors, (4956), 27 states have internal predecessors, (4956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:09,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:09,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 691 [2023-11-06 22:57:09,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:14,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:16,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:19,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:21,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:23,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:26,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:28,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:31,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:33,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:57:37,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:57:39,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:57:43,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:57:46,319 INFO L124 PetriNetUnfolderBase]: 912/1830 cut-off events. [2023-11-06 22:57:46,319 INFO L125 PetriNetUnfolderBase]: For 1882/1882 co-relation queries the response was YES. [2023-11-06 22:57:46,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 1830 events. 912/1830 cut-off events. For 1882/1882 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10698 event pairs, 294 based on Foata normal form. 21/1736 useless extension candidates. Maximal degree in co-relation 4842. Up to 863 conditions per place. [2023-11-06 22:57:46,332 INFO L140 encePairwiseOnDemand]: 671/691 looper letters, 146 selfloop transitions, 55 changer transitions 0/207 dead transitions. [2023-11-06 22:57:46,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 207 transitions, 1379 flow [2023-11-06 22:57:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:57:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:57:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3086 transitions. [2023-11-06 22:57:46,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2791244573082489 [2023-11-06 22:57:46,346 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3086 transitions. [2023-11-06 22:57:46,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3086 transitions. [2023-11-06 22:57:46,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:57:46,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3086 transitions. [2023-11-06 22:57:46,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 192.875) internal successors, (3086), 16 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:46,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 691.0) internal successors, (11747), 17 states have internal predecessors, (11747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:46,381 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 691.0) internal successors, (11747), 17 states have internal predecessors, (11747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:46,381 INFO L175 Difference]: Start difference. First operand has 104 places, 96 transitions, 611 flow. Second operand 16 states and 3086 transitions. [2023-11-06 22:57:46,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 207 transitions, 1379 flow [2023-11-06 22:57:46,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 207 transitions, 1249 flow, removed 54 selfloop flow, removed 6 redundant places. [2023-11-06 22:57:46,397 INFO L231 Difference]: Finished difference. Result has 120 places, 122 transitions, 839 flow [2023-11-06 22:57:46,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=839, PETRI_PLACES=120, PETRI_TRANSITIONS=122} [2023-11-06 22:57:46,399 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 14 predicate places. [2023-11-06 22:57:46,399 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 122 transitions, 839 flow [2023-11-06 22:57:46,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 183.55555555555554) internal successors, (4956), 27 states have internal predecessors, (4956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:46,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:57:46,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:46,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:57:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:57:46,608 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:57:46,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1039042783, now seen corresponding path program 2 times [2023-11-06 22:57:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:46,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504266391] [2023-11-06 22:57:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504266391] [2023-11-06 22:57:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504266391] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:57:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654728970] [2023-11-06 22:57:48,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:57:48,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:57:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:48,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:57:48,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:57:48,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:57:48,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:57:48,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-06 22:57:48,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:48,664 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:48,796 INFO L322 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2023-11-06 22:57:48,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2023-11-06 22:57:49,000 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-11-06 22:57:49,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2023-11-06 22:57:49,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 22:57:49,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:57:49,408 INFO L322 Elim1Store]: treesize reduction 32, result has 50.8 percent of original size [2023-11-06 22:57:49,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 51 [2023-11-06 22:57:49,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-06 22:57:49,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:49,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2023-11-06 22:57:50,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-06 22:57:50,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-11-06 22:57:51,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-11-06 22:57:51,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-11-06 22:57:51,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-06 22:57:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:51,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:57:51,848 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_483 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_483 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 22:57:51,897 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-11-06 22:57:51,941 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 22:57:51,983 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_483) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 22:57:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654728970] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:57:53,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:57:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-06 22:57:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922106896] [2023-11-06 22:57:53,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:57:53,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:57:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:57:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=365, Unknown=5, NotChecked=172, Total=650 [2023-11-06 22:57:53,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 691 [2023-11-06 22:57:53,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 122 transitions, 839 flow. Second operand has 26 states, 26 states have (on average 183.6153846153846) internal successors, (4774), 26 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:53,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:57:53,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 691 [2023-11-06 22:57:53,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:57:57,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:57:59,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:01,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:04,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:07,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:09,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:11,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:13,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:15,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:17,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:20,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:22,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:26,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:28,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:31,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:35,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:58:36,022 INFO L124 PetriNetUnfolderBase]: 1300/2584 cut-off events. [2023-11-06 22:58:36,022 INFO L125 PetriNetUnfolderBase]: For 5773/5869 co-relation queries the response was YES. [2023-11-06 22:58:36,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9047 conditions, 2584 events. 1300/2584 cut-off events. For 5773/5869 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 16247 event pairs, 443 based on Foata normal form. 14/2450 useless extension candidates. Maximal degree in co-relation 9015. Up to 1199 conditions per place. [2023-11-06 22:58:36,041 INFO L140 encePairwiseOnDemand]: 669/691 looper letters, 171 selfloop transitions, 83 changer transitions 0/260 dead transitions. [2023-11-06 22:58:36,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 260 transitions, 2119 flow [2023-11-06 22:58:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:58:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-06 22:58:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3655 transitions. [2023-11-06 22:58:36,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27839134739888793 [2023-11-06 22:58:36,054 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3655 transitions. [2023-11-06 22:58:36,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3655 transitions. [2023-11-06 22:58:36,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:58:36,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3655 transitions. [2023-11-06 22:58:36,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 192.3684210526316) internal successors, (3655), 19 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:36,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 691.0) internal successors, (13820), 20 states have internal predecessors, (13820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:36,083 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 691.0) internal successors, (13820), 20 states have internal predecessors, (13820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:36,083 INFO L175 Difference]: Start difference. First operand has 120 places, 122 transitions, 839 flow. Second operand 19 states and 3655 transitions. [2023-11-06 22:58:36,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 260 transitions, 2119 flow [2023-11-06 22:58:36,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 260 transitions, 2047 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-11-06 22:58:36,112 INFO L231 Difference]: Finished difference. Result has 142 places, 169 transitions, 1453 flow [2023-11-06 22:58:36,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1453, PETRI_PLACES=142, PETRI_TRANSITIONS=169} [2023-11-06 22:58:36,113 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 36 predicate places. [2023-11-06 22:58:36,113 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 169 transitions, 1453 flow [2023-11-06 22:58:36,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 183.6153846153846) internal successors, (4774), 26 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:36,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:58:36,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:36,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 22:58:36,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:58:36,321 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:58:36,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash -235382859, now seen corresponding path program 1 times [2023-11-06 22:58:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:36,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999554691] [2023-11-06 22:58:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:36,423 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-06 22:58:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999554691] [2023-11-06 22:58:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999554691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:58:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188159780] [2023-11-06 22:58:36,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:36,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:58:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:36,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:58:36,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:58:36,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 691 [2023-11-06 22:58:36,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 169 transitions, 1453 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:36,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:58:36,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 691 [2023-11-06 22:58:36,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:58:37,310 INFO L124 PetriNetUnfolderBase]: 1271/2555 cut-off events. [2023-11-06 22:58:37,310 INFO L125 PetriNetUnfolderBase]: For 15425/15871 co-relation queries the response was YES. [2023-11-06 22:58:37,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12416 conditions, 2555 events. 1271/2555 cut-off events. For 15425/15871 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 16200 event pairs, 604 based on Foata normal form. 8/2424 useless extension candidates. Maximal degree in co-relation 12378. Up to 1202 conditions per place. [2023-11-06 22:58:37,340 INFO L140 encePairwiseOnDemand]: 687/691 looper letters, 162 selfloop transitions, 4 changer transitions 0/181 dead transitions. [2023-11-06 22:58:37,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 181 transitions, 1885 flow [2023-11-06 22:58:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:58:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:58:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2023-11-06 22:58:37,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331886155330439 [2023-11-06 22:58:37,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 898 transitions. [2023-11-06 22:58:37,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 898 transitions. [2023-11-06 22:58:37,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:58:37,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 898 transitions. [2023-11-06 22:58:37,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:37,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:37,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 691.0) internal successors, (2764), 4 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:37,349 INFO L175 Difference]: Start difference. First operand has 142 places, 169 transitions, 1453 flow. Second operand 3 states and 898 transitions. [2023-11-06 22:58:37,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 181 transitions, 1885 flow [2023-11-06 22:58:37,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 181 transitions, 1757 flow, removed 51 selfloop flow, removed 6 redundant places. [2023-11-06 22:58:37,379 INFO L231 Difference]: Finished difference. Result has 135 places, 167 transitions, 1323 flow [2023-11-06 22:58:37,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1323, PETRI_PLACES=135, PETRI_TRANSITIONS=167} [2023-11-06 22:58:37,380 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 29 predicate places. [2023-11-06 22:58:37,380 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 167 transitions, 1323 flow [2023-11-06 22:58:37,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:37,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:58:37,380 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:37,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:58:37,381 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:58:37,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2107589623, now seen corresponding path program 1 times [2023-11-06 22:58:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700157791] [2023-11-06 22:58:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:37,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700157791] [2023-11-06 22:58:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700157791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:58:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087025345] [2023-11-06 22:58:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:37,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:58:37,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:58:37,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:58:37,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:58:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:37,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:58:37,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:58:38,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:58:38,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:58:38,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-06 22:58:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:38,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:58:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:39,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087025345] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:58:39,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:58:39,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-11-06 22:58:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152245106] [2023-11-06 22:58:39,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:58:39,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:58:39,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:58:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:58:43,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 691 [2023-11-06 22:58:43,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 167 transitions, 1323 flow. Second operand has 11 states, 11 states have (on average 279.6363636363636) internal successors, (3076), 11 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:43,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:58:43,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 691 [2023-11-06 22:58:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:58:45,113 INFO L124 PetriNetUnfolderBase]: 1122/2255 cut-off events. [2023-11-06 22:58:45,113 INFO L125 PetriNetUnfolderBase]: For 17498/17980 co-relation queries the response was YES. [2023-11-06 22:58:45,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12630 conditions, 2255 events. 1122/2255 cut-off events. For 17498/17980 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 12130 event pairs, 429 based on Foata normal form. 148/2319 useless extension candidates. Maximal degree in co-relation 12591. Up to 941 conditions per place. [2023-11-06 22:58:45,145 INFO L140 encePairwiseOnDemand]: 686/691 looper letters, 188 selfloop transitions, 11 changer transitions 0/215 dead transitions. [2023-11-06 22:58:45,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 215 transitions, 2217 flow [2023-11-06 22:58:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:58:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:58:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2033 transitions. [2023-11-06 22:58:45,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4203018399834608 [2023-11-06 22:58:45,150 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2033 transitions. [2023-11-06 22:58:45,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2033 transitions. [2023-11-06 22:58:45,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:58:45,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2033 transitions. [2023-11-06 22:58:45,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 290.42857142857144) internal successors, (2033), 7 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:45,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 691.0) internal successors, (5528), 8 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:45,161 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 691.0) internal successors, (5528), 8 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:45,162 INFO L175 Difference]: Start difference. First operand has 135 places, 167 transitions, 1323 flow. Second operand 7 states and 2033 transitions. [2023-11-06 22:58:45,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 215 transitions, 2217 flow [2023-11-06 22:58:45,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 215 transitions, 2191 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-06 22:58:45,196 INFO L231 Difference]: Finished difference. Result has 139 places, 156 transitions, 1275 flow [2023-11-06 22:58:45,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=691, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1275, PETRI_PLACES=139, PETRI_TRANSITIONS=156} [2023-11-06 22:58:45,197 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 33 predicate places. [2023-11-06 22:58:45,197 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 156 transitions, 1275 flow [2023-11-06 22:58:45,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 279.6363636363636) internal successors, (3076), 11 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:58:45,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:58:45,198 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:45,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:58:45,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:58:45,404 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 22:58:45,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1018605262, now seen corresponding path program 3 times [2023-11-06 22:58:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399492704] [2023-11-06 22:58:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:47,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:47,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399492704] [2023-11-06 22:58:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399492704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:58:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639352898] [2023-11-06 22:58:47,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:58:47,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:58:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:58:47,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:58:47,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbef184-a519-4038-976b-afbc77b91b7c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:58:48,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:58:48,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:58:48,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-06 22:58:48,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:58:48,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:58:48,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:58:48,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:58:48,581 INFO L322 Elim1Store]: treesize reduction 28, result has 50.9 percent of original size [2023-11-06 22:58:48,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 47 [2023-11-06 22:58:48,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-06 22:58:48,701 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:58:48,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:58:48,841 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-06 22:58:48,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 22:58:48,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:58:49,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-06 22:58:50,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-06 22:58:50,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2023-11-06 22:58:50,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2023-11-06 22:58:51,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2023-11-06 22:58:51,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 75 [2023-11-06 22:58:52,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 278 [2023-11-06 22:58:53,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 345 treesize of output 278 [2023-11-06 22:58:54,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1077 treesize of output 898 [2023-11-06 22:58:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:55,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:58:55,244 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_657 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_657 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-06 22:58:55,273 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_657 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_657 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-11-06 22:58:55,301 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_657 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_657 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-06 22:58:57,821 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_653 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_653))) (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_653 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_653))) (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-06 22:59:04,769 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_110| Int) (v_ArrVal_651 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_651) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_110|) (forall ((v_ArrVal_653 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_653))) (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_110| Int) (v_ArrVal_651 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_651) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_110|) (forall ((v_ArrVal_653 Int) (v_ArrVal_657 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_110| 4) |c_~#queue~0.offset|) v_ArrVal_653))) (store (store .cse5 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_657) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))) is different from false