./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:21:21,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:21:21,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:21:21,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:21:21,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:21:21,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:21:21,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:21:21,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:21:21,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:21:21,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:21:21,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:21:21,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:21:21,977 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:21:21,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:21:21,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:21:21,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:21:21,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:21:21,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:21:21,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:21:21,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:21:21,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:21:21,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:21:21,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:21:21,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:21:21,984 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:21:21,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:21:21,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:21:21,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:21:21,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:21:21,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:21:21,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:21:21,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:21:21,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:21:21,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:21:21,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:21:21,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:21:21,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:21:21,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:21:21,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:21:21,990 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_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/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_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2023-11-21 22:21:22,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:21:22,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:21:22,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:21:22,319 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:21:22,319 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:21:22,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-21 22:21:25,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:21:25,827 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:21:25,828 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-21 22:21:25,845 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data/bf9bb25f3/9d5a0c4b99bf4732b289046afa4fc347/FLAGe9a7f0bc9 [2023-11-21 22:21:25,860 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data/bf9bb25f3/9d5a0c4b99bf4732b289046afa4fc347 [2023-11-21 22:21:25,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:21:25,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:21:25,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:21:25,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:21:25,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:21:25,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:21:25" (1/1) ... [2023-11-21 22:21:25,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdb5cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:25, skipping insertion in model container [2023-11-21 22:21:25,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:21:25" (1/1) ... [2023-11-21 22:21:25,945 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:21:26,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:21:26,443 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:21:26,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:21:26,570 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:21:26,571 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:21:26,579 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:21:26,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26 WrapperNode [2023-11-21 22:21:26,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:21:26,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:21:26,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:21:26,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:21:26,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,680 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-21 22:21:26,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:21:26,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:21:26,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:21:26,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:21:26,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:21:26,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:21:26,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:21:26,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:21:26,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (1/1) ... [2023-11-21 22:21:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:21:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:21:26,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:21:26,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:21:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:21:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:21:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:21:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:21:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:21:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:21:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:21:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:21:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:21:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:21:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:21:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 22:21:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 22:21:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:21:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:21:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:21:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:21:26,860 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:21:27,064 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:21:27,065 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:21:27,428 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:21:27,734 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:21:27,734 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:21:27,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:21:27 BoogieIcfgContainer [2023-11-21 22:21:27,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:21:27,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:21:27,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:21:27,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:21:27,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:21:25" (1/3) ... [2023-11-21 22:21:27,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0429a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:21:27, skipping insertion in model container [2023-11-21 22:21:27,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:26" (2/3) ... [2023-11-21 22:21:27,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0429a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:21:27, skipping insertion in model container [2023-11-21 22:21:27,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:21:27" (3/3) ... [2023-11-21 22:21:27,762 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-21 22:21:27,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:21:27,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-21 22:21:27,783 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:21:27,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:21:27,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-21 22:21:27,949 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-21 22:21:27,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:21:27,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-21 22:21:27,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-21 22:21:27,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-21 22:21:27,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:21:27,977 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;@7c39f423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:21:27,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-21 22:21:27,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:21:27,981 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:21:27,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:21:27,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:27,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:21:27,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:27,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash 12996, now seen corresponding path program 1 times [2023-11-21 22:21:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599982846] [2023-11-21 22:21:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:28,301 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-21 22:21:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599982846] [2023-11-21 22:21:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599982846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:28,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:21:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983802657] [2023-11-21 22:21:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:28,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:28,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:28,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-21 22:21:28,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:28,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:28,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-21 22:21:28,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:29,116 INFO L124 PetriNetUnfolderBase]: 1175/2175 cut-off events. [2023-11-21 22:21:29,116 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-21 22:21:29,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2175 events. 1175/2175 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16978 event pairs, 879 based on Foata normal form. 120/2122 useless extension candidates. Maximal degree in co-relation 3897. Up to 1277 conditions per place. [2023-11-21 22:21:29,154 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-21 22:21:29,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 206 flow [2023-11-21 22:21:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:21:29,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:21:29,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:21:29,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:21:29,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:29,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:21:29,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,191 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:21:29,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 206 flow [2023-11-21 22:21:29,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:21:29,200 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-21 22:21:29,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-21 22:21:29,209 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-21 22:21:29,209 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-21 22:21:29,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:29,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:21:29,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:21:29,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:29,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 12997, now seen corresponding path program 1 times [2023-11-21 22:21:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190039986] [2023-11-21 22:21:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:29,452 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-21 22:21:29,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190039986] [2023-11-21 22:21:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190039986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:29,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:29,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:21:29,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507997337] [2023-11-21 22:21:29,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:29,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:29,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-21 22:21:29,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:29,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-21 22:21:29,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:29,934 INFO L124 PetriNetUnfolderBase]: 1175/2174 cut-off events. [2023-11-21 22:21:29,934 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-21 22:21:29,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3968 conditions, 2174 events. 1175/2174 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16904 event pairs, 879 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 3957. Up to 1276 conditions per place. [2023-11-21 22:21:29,958 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-21 22:21:29,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-21 22:21:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:21:29,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:21:29,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:21:29,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:21:29,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:29,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:21:29,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,975 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:21:29,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-21 22:21:29,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:29,985 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-21 22:21:29,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-21 22:21:29,986 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-21 22:21:29,987 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-21 22:21:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:29,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:29,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:21:29,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:21:29,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:29,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 387569917, now seen corresponding path program 1 times [2023-11-21 22:21:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:29,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854313231] [2023-11-21 22:21:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:30,116 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-21 22:21:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854313231] [2023-11-21 22:21:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854313231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:21:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039139444] [2023-11-21 22:21:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:30,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:30,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-21 22:21:30,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:30,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-21 22:21:30,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:30,601 INFO L124 PetriNetUnfolderBase]: 1176/2173 cut-off events. [2023-11-21 22:21:30,601 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-21 22:21:30,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 2173 events. 1176/2173 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16832 event pairs, 742 based on Foata normal form. 0/2004 useless extension candidates. Maximal degree in co-relation 3959. Up to 1276 conditions per place. [2023-11-21 22:21:30,625 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-21 22:21:30,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-21 22:21:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:21:30,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-21 22:21:30,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:21:30,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:21:30,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:30,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:21:30,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,631 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:21:30,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-21 22:21:30,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:30,638 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-21 22:21:30,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-21 22:21:30,640 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-21 22:21:30,640 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-21 22:21:30,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:30,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:21:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:21:30,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:30,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 387569918, now seen corresponding path program 1 times [2023-11-21 22:21:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478604403] [2023-11-21 22:21:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:30,721 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-21 22:21:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:30,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478604403] [2023-11-21 22:21:30,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478604403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:30,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:21:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309029202] [2023-11-21 22:21:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:30,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-21 22:21:30,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:30,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-21 22:21:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:31,192 INFO L124 PetriNetUnfolderBase]: 1175/2170 cut-off events. [2023-11-21 22:21:31,192 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-21 22:21:31,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 2170 events. 1175/2170 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16726 event pairs, 742 based on Foata normal form. 2/2004 useless extension candidates. Maximal degree in co-relation 3955. Up to 1273 conditions per place. [2023-11-21 22:21:31,215 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-21 22:21:31,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-21 22:21:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:21:31,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:21:31,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:21:31,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:21:31,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:31,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:21:31,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,219 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:21:31,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-21 22:21:31,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:31,223 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-21 22:21:31,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-21 22:21:31,224 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-21 22:21:31,225 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-21 22:21:31,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:31,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:31,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:21:31,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:31,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1223715142, now seen corresponding path program 1 times [2023-11-21 22:21:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101388435] [2023-11-21 22:21:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:31,282 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-21 22:21:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101388435] [2023-11-21 22:21:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101388435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:31,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:31,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:21:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544377954] [2023-11-21 22:21:31,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:31,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:31,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-21 22:21:31,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:31,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-21 22:21:31,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:31,694 INFO L124 PetriNetUnfolderBase]: 1179/2167 cut-off events. [2023-11-21 22:21:31,695 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-21 22:21:31,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 2167 events. 1179/2167 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17206 event pairs, 880 based on Foata normal form. 0/2010 useless extension candidates. Maximal degree in co-relation 3960. Up to 1272 conditions per place. [2023-11-21 22:21:31,719 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-21 22:21:31,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-21 22:21:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:21:31,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-21 22:21:31,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:21:31,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:21:31,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:31,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:21:31,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,725 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:21:31,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-21 22:21:31,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:31,733 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-21 22:21:31,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-21 22:21:31,735 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-21 22:21:31,736 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-21 22:21:31,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:31,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:31,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:21:31,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:31,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1223715143, now seen corresponding path program 1 times [2023-11-21 22:21:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358319904] [2023-11-21 22:21:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:31,864 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-21 22:21:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358319904] [2023-11-21 22:21:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358319904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:21:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545975284] [2023-11-21 22:21:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:31,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-21 22:21:31,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:31,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-21 22:21:31,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:32,278 INFO L124 PetriNetUnfolderBase]: 1175/2151 cut-off events. [2023-11-21 22:21:32,278 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-21 22:21:32,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3948 conditions, 2151 events. 1175/2151 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16766 event pairs, 876 based on Foata normal form. 4/1991 useless extension candidates. Maximal degree in co-relation 3938. Up to 1264 conditions per place. [2023-11-21 22:21:32,297 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-21 22:21:32,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-21 22:21:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:21:32,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:21:32,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:21:32,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:21:32,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:32,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:21:32,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,301 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:21:32,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-21 22:21:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:32,306 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-21 22:21:32,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-21 22:21:32,307 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-11-21 22:21:32,307 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-21 22:21:32,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:32,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:21:32,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:32,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 15794217, now seen corresponding path program 1 times [2023-11-21 22:21:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341790255] [2023-11-21 22:21:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,396 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-21 22:21:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341790255] [2023-11-21 22:21:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341790255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:21:32,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454884485] [2023-11-21 22:21:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:32,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-21 22:21:32,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:32,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-21 22:21:32,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:32,775 INFO L124 PetriNetUnfolderBase]: 1175/2150 cut-off events. [2023-11-21 22:21:32,775 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-21 22:21:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 2150 events. 1175/2150 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16352 event pairs, 459 based on Foata normal form. 12/2011 useless extension candidates. Maximal degree in co-relation 3937. Up to 1232 conditions per place. [2023-11-21 22:21:32,799 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-21 22:21:32,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 192 flow [2023-11-21 22:21:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:21:32,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:21:32,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:21:32,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:21:32,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:32,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:21:32,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,805 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:21:32,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 192 flow [2023-11-21 22:21:32,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:32,810 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-21 22:21:32,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-21 22:21:32,812 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-21 22:21:32,812 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-21 22:21:32,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:32,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:21:32,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:32,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash 15794216, now seen corresponding path program 1 times [2023-11-21 22:21:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906201016] [2023-11-21 22:21:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,877 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-21 22:21:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906201016] [2023-11-21 22:21:32,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906201016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:21:32,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241856456] [2023-11-21 22:21:32,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:32,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:32,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:32,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-21 22:21:32,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:32,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-21 22:21:32,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:33,315 INFO L124 PetriNetUnfolderBase]: 1195/2158 cut-off events. [2023-11-21 22:21:33,315 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-21 22:21:33,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3995 conditions, 2158 events. 1195/2158 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 16444 event pairs, 459 based on Foata normal form. 0/2009 useless extension candidates. Maximal degree in co-relation 3985. Up to 1264 conditions per place. [2023-11-21 22:21:33,335 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-21 22:21:33,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 192 flow [2023-11-21 22:21:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:21:33,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-21 22:21:33,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:21:33,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:21:33,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:33,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:21:33,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,344 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:21:33,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 192 flow [2023-11-21 22:21:33,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:33,350 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-21 22:21:33,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-21 22:21:33,352 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-21 22:21:33,353 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-21 22:21:33,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:33,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:21:33,354 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:33,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1920500071, now seen corresponding path program 1 times [2023-11-21 22:21:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134965497] [2023-11-21 22:21:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:33,507 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-21 22:21:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134965497] [2023-11-21 22:21:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134965497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:21:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70237070] [2023-11-21 22:21:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:33,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:33,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 65 [2023-11-21 22:21:33,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:33,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 65 [2023-11-21 22:21:33,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:33,805 INFO L124 PetriNetUnfolderBase]: 931/1678 cut-off events. [2023-11-21 22:21:33,806 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-21 22:21:33,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3131 conditions, 1678 events. 931/1678 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11948 event pairs, 199 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 3121. Up to 1021 conditions per place. [2023-11-21 22:21:33,817 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-21 22:21:33,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 200 flow [2023-11-21 22:21:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:21:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2023-11-21 22:21:33,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7743589743589744 [2023-11-21 22:21:33,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2023-11-21 22:21:33,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2023-11-21 22:21:33,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:33,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2023-11-21 22:21:33,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,822 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 151 transitions. [2023-11-21 22:21:33,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 200 flow [2023-11-21 22:21:33,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:33,824 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 108 flow [2023-11-21 22:21:33,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-21 22:21:33,825 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-21 22:21:33,826 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 108 flow [2023-11-21 22:21:33,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:33,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:21:33,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:33,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash 194386406, now seen corresponding path program 1 times [2023-11-21 22:21:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725798458] [2023-11-21 22:21:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:34,650 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-21 22:21:34,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:34,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725798458] [2023-11-21 22:21:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725798458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:21:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116628592] [2023-11-21 22:21:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:34,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:21:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:21:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:21:34,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-21 22:21:34,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:34,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-21 22:21:34,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:35,332 INFO L124 PetriNetUnfolderBase]: 819/1494 cut-off events. [2023-11-21 22:21:35,333 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-21 22:21:35,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1494 events. 819/1494 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10104 event pairs, 528 based on Foata normal form. 48/1516 useless extension candidates. Maximal degree in co-relation 2805. Up to 980 conditions per place. [2023-11-21 22:21:35,345 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 25 selfloop transitions, 4 changer transitions 8/61 dead transitions. [2023-11-21 22:21:35,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 210 flow [2023-11-21 22:21:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:21:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:21:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2023-11-21 22:21:35,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912087912087912 [2023-11-21 22:21:35,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 269 transitions. [2023-11-21 22:21:35,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 269 transitions. [2023-11-21 22:21:35,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:35,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 269 transitions. [2023-11-21 22:21:35,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 38.42857142857143) internal successors, (269), 7 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:35,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:35,352 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:35,352 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 7 states and 269 transitions. [2023-11-21 22:21:35,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 210 flow [2023-11-21 22:21:35,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:35,354 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 108 flow [2023-11-21 22:21:35,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-11-21 22:21:35,356 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-21 22:21:35,356 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 108 flow [2023-11-21 22:21:35,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:35,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:35,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:35,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:21:35,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:35,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 194387718, now seen corresponding path program 1 times [2023-11-21 22:21:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:35,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290787568] [2023-11-21 22:21:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:35,594 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-21 22:21:35,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290787568] [2023-11-21 22:21:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290787568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:35,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:35,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:21:35,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013104474] [2023-11-21 22:21:35,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:35,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:35,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:35,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:35,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-21 22:21:35,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:35,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:35,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-21 22:21:35,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:36,489 INFO L124 PetriNetUnfolderBase]: 3857/6080 cut-off events. [2023-11-21 22:21:36,490 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-21 22:21:36,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 6080 events. 3857/6080 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 42706 event pairs, 536 based on Foata normal form. 180/6248 useless extension candidates. Maximal degree in co-relation 11583. Up to 3346 conditions per place. [2023-11-21 22:21:36,541 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 44 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2023-11-21 22:21:36,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 274 flow [2023-11-21 22:21:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:21:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:21:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2023-11-21 22:21:36,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7269230769230769 [2023-11-21 22:21:36,544 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 189 transitions. [2023-11-21 22:21:36,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 189 transitions. [2023-11-21 22:21:36,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:36,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 189 transitions. [2023-11-21 22:21:36,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:36,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:36,547 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:36,547 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 108 flow. Second operand 4 states and 189 transitions. [2023-11-21 22:21:36,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 274 flow [2023-11-21 22:21:36,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:21:36,550 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 143 flow [2023-11-21 22:21:36,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-21 22:21:36,551 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-21 22:21:36,551 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 143 flow [2023-11-21 22:21:36,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:36,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:36,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:36,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:21:36,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:36,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1688212379, now seen corresponding path program 1 times [2023-11-21 22:21:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429736656] [2023-11-21 22:21:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:36,849 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-21 22:21:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:36,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429736656] [2023-11-21 22:21:36,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429736656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:36,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:36,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924952037] [2023-11-21 22:21:36,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:36,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:36,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:36,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:36,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-21 22:21:36,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:36,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:36,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-21 22:21:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:37,675 INFO L124 PetriNetUnfolderBase]: 3272/5183 cut-off events. [2023-11-21 22:21:37,675 INFO L125 PetriNetUnfolderBase]: For 1389/1389 co-relation queries the response was YES. [2023-11-21 22:21:37,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11850 conditions, 5183 events. 3272/5183 cut-off events. For 1389/1389 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 35084 event pairs, 192 based on Foata normal form. 174/5345 useless extension candidates. Maximal degree in co-relation 11837. Up to 2581 conditions per place. [2023-11-21 22:21:37,722 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 56 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2023-11-21 22:21:37,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 384 flow [2023-11-21 22:21:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:21:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2023-11-21 22:21:37,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7353846153846154 [2023-11-21 22:21:37,724 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 239 transitions. [2023-11-21 22:21:37,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 239 transitions. [2023-11-21 22:21:37,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:37,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 239 transitions. [2023-11-21 22:21:37,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:37,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:37,727 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:37,728 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 143 flow. Second operand 5 states and 239 transitions. [2023-11-21 22:21:37,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 384 flow [2023-11-21 22:21:37,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 373 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:37,732 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 195 flow [2023-11-21 22:21:37,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-21 22:21:37,733 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-21 22:21:37,733 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 195 flow [2023-11-21 22:21:37,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:37,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:37,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:37,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:21:37,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:37,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 467414188, now seen corresponding path program 1 times [2023-11-21 22:21:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:37,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015098003] [2023-11-21 22:21:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:37,973 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-21 22:21:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015098003] [2023-11-21 22:21:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015098003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:37,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328421332] [2023-11-21 22:21:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:37,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-21 22:21:37,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:37,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:37,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-21 22:21:37,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:38,635 INFO L124 PetriNetUnfolderBase]: 2201/3466 cut-off events. [2023-11-21 22:21:38,635 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2023-11-21 22:21:38,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9004 conditions, 3466 events. 2201/3466 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 20386 event pairs, 69 based on Foata normal form. 140/3594 useless extension candidates. Maximal degree in co-relation 8989. Up to 1221 conditions per place. [2023-11-21 22:21:38,666 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 66 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2023-11-21 22:21:38,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 504 flow [2023-11-21 22:21:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:21:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2023-11-21 22:21:38,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.735897435897436 [2023-11-21 22:21:38,668 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 287 transitions. [2023-11-21 22:21:38,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 287 transitions. [2023-11-21 22:21:38,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:38,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 287 transitions. [2023-11-21 22:21:38,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:38,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:38,672 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:38,672 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 195 flow. Second operand 6 states and 287 transitions. [2023-11-21 22:21:38,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 504 flow [2023-11-21 22:21:38,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 474 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 22:21:38,680 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 245 flow [2023-11-21 22:21:38,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-21 22:21:38,681 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-21 22:21:38,682 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 245 flow [2023-11-21 22:21:38,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:38,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:38,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:38,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:21:38,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:38,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash 596569769, now seen corresponding path program 1 times [2023-11-21 22:21:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363539517] [2023-11-21 22:21:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:38,915 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-21 22:21:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:38,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363539517] [2023-11-21 22:21:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363539517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:38,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974402550] [2023-11-21 22:21:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:21:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:21:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:21:38,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-21 22:21:38,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:38,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:38,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-21 22:21:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:39,395 INFO L124 PetriNetUnfolderBase]: 1353/2046 cut-off events. [2023-11-21 22:21:39,395 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES. [2023-11-21 22:21:39,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6093 conditions, 2046 events. 1353/2046 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10189 event pairs, 39 based on Foata normal form. 72/2106 useless extension candidates. Maximal degree in co-relation 6077. Up to 668 conditions per place. [2023-11-21 22:21:39,413 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 60 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2023-11-21 22:21:39,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 506 flow [2023-11-21 22:21:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:21:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:21:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 319 transitions. [2023-11-21 22:21:39,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.701098901098901 [2023-11-21 22:21:39,416 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 319 transitions. [2023-11-21 22:21:39,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 319 transitions. [2023-11-21 22:21:39,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:39,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 319 transitions. [2023-11-21 22:21:39,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:39,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:39,420 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:39,420 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 245 flow. Second operand 7 states and 319 transitions. [2023-11-21 22:21:39,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 506 flow [2023-11-21 22:21:39,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 460 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-21 22:21:39,433 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 255 flow [2023-11-21 22:21:39,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-11-21 22:21:39,434 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2023-11-21 22:21:39,434 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 255 flow [2023-11-21 22:21:39,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:39,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:39,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:39,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:21:39,435 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:39,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1603265036, now seen corresponding path program 1 times [2023-11-21 22:21:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208676598] [2023-11-21 22:21:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:39,715 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-21 22:21:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208676598] [2023-11-21 22:21:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208676598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128437767] [2023-11-21 22:21:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:39,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-21 22:21:39,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:39,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:39,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-21 22:21:39,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:40,351 INFO L124 PetriNetUnfolderBase]: 1702/2995 cut-off events. [2023-11-21 22:21:40,351 INFO L125 PetriNetUnfolderBase]: For 1897/2000 co-relation queries the response was YES. [2023-11-21 22:21:40,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7196 conditions, 2995 events. 1702/2995 cut-off events. For 1897/2000 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19196 event pairs, 330 based on Foata normal form. 16/2814 useless extension candidates. Maximal degree in co-relation 7179. Up to 1106 conditions per place. [2023-11-21 22:21:40,378 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 40 selfloop transitions, 2 changer transitions 12/89 dead transitions. [2023-11-21 22:21:40,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 441 flow [2023-11-21 22:21:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:21:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-11-21 22:21:40,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948717948717948 [2023-11-21 22:21:40,381 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-11-21 22:21:40,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-11-21 22:21:40,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:40,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-11-21 22:21:40,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:40,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:40,385 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:40,385 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 255 flow. Second operand 6 states and 271 transitions. [2023-11-21 22:21:40,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 441 flow [2023-11-21 22:21:40,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 335 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-21 22:21:40,405 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 176 flow [2023-11-21 22:21:40,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-21 22:21:40,406 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2023-11-21 22:21:40,406 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 176 flow [2023-11-21 22:21:40,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:40,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:40,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:40,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:21:40,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:40,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 352232428, now seen corresponding path program 2 times [2023-11-21 22:21:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:40,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111220538] [2023-11-21 22:21:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:40,817 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-21 22:21:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111220538] [2023-11-21 22:21:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111220538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027581032] [2023-11-21 22:21:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:40,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:40,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:40,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-21 22:21:40,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:40,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:40,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-21 22:21:40,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:41,907 INFO L124 PetriNetUnfolderBase]: 4460/7593 cut-off events. [2023-11-21 22:21:41,908 INFO L125 PetriNetUnfolderBase]: For 719/721 co-relation queries the response was YES. [2023-11-21 22:21:41,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15708 conditions, 7593 events. 4460/7593 cut-off events. For 719/721 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 54863 event pairs, 1317 based on Foata normal form. 17/7113 useless extension candidates. Maximal degree in co-relation 15693. Up to 2923 conditions per place. [2023-11-21 22:21:41,957 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 44 selfloop transitions, 6 changer transitions 16/99 dead transitions. [2023-11-21 22:21:41,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 410 flow [2023-11-21 22:21:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:21:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2023-11-21 22:21:41,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6897435897435897 [2023-11-21 22:21:41,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 269 transitions. [2023-11-21 22:21:41,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 269 transitions. [2023-11-21 22:21:41,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:41,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 269 transitions. [2023-11-21 22:21:41,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:41,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:41,963 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:41,964 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 176 flow. Second operand 6 states and 269 transitions. [2023-11-21 22:21:41,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 410 flow [2023-11-21 22:21:41,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 403 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-21 22:21:41,970 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 212 flow [2023-11-21 22:21:41,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-11-21 22:21:41,971 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2023-11-21 22:21:41,971 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 212 flow [2023-11-21 22:21:41,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:41,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:41,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:41,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:21:41,973 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:41,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1990547502, now seen corresponding path program 3 times [2023-11-21 22:21:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067411741] [2023-11-21 22:21:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:42,542 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-21 22:21:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067411741] [2023-11-21 22:21:42,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067411741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:42,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:42,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 22:21:42,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432773076] [2023-11-21 22:21:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:42,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 22:21:42,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:42,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 22:21:42,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:21:42,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-21 22:21:42,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 212 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:42,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:42,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-21 22:21:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:44,063 INFO L124 PetriNetUnfolderBase]: 6015/10528 cut-off events. [2023-11-21 22:21:44,064 INFO L125 PetriNetUnfolderBase]: For 719/793 co-relation queries the response was YES. [2023-11-21 22:21:44,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21750 conditions, 10528 events. 6015/10528 cut-off events. For 719/793 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 83121 event pairs, 1192 based on Foata normal form. 73/9797 useless extension candidates. Maximal degree in co-relation 21732. Up to 3317 conditions per place. [2023-11-21 22:21:44,138 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 65 selfloop transitions, 12 changer transitions 12/127 dead transitions. [2023-11-21 22:21:44,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 127 transitions, 556 flow [2023-11-21 22:21:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:21:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-21 22:21:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 481 transitions. [2023-11-21 22:21:44,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2023-11-21 22:21:44,141 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 481 transitions. [2023-11-21 22:21:44,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 481 transitions. [2023-11-21 22:21:44,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:44,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 481 transitions. [2023-11-21 22:21:44,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 43.72727272727273) internal successors, (481), 11 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:44,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:44,146 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:44,146 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 212 flow. Second operand 11 states and 481 transitions. [2023-11-21 22:21:44,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 127 transitions, 556 flow [2023-11-21 22:21:44,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 127 transitions, 546 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:44,153 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 302 flow [2023-11-21 22:21:44,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=302, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2023-11-21 22:21:44,154 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 15 predicate places. [2023-11-21 22:21:44,154 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 302 flow [2023-11-21 22:21:44,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:44,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:44,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:44,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:21:44,155 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:44,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash 166567096, now seen corresponding path program 4 times [2023-11-21 22:21:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907455876] [2023-11-21 22:21:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:44,426 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-21 22:21:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907455876] [2023-11-21 22:21:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907455876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:44,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053382967] [2023-11-21 22:21:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:44,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:44,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-21 22:21:44,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:44,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:44,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-21 22:21:44,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:47,936 INFO L124 PetriNetUnfolderBase]: 14182/23875 cut-off events. [2023-11-21 22:21:47,936 INFO L125 PetriNetUnfolderBase]: For 11819/11843 co-relation queries the response was YES. [2023-11-21 22:21:48,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57426 conditions, 23875 events. 14182/23875 cut-off events. For 11819/11843 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 204118 event pairs, 3771 based on Foata normal form. 16/22335 useless extension candidates. Maximal degree in co-relation 57401. Up to 9948 conditions per place. [2023-11-21 22:21:48,118 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 61 selfloop transitions, 17 changer transitions 29/139 dead transitions. [2023-11-21 22:21:48,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 782 flow [2023-11-21 22:21:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:21:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:21:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 309 transitions. [2023-11-21 22:21:48,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6791208791208792 [2023-11-21 22:21:48,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 309 transitions. [2023-11-21 22:21:48,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 309 transitions. [2023-11-21 22:21:48,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:48,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 309 transitions. [2023-11-21 22:21:48,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.142857142857146) internal successors, (309), 7 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:48,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:48,124 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:48,125 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 302 flow. Second operand 7 states and 309 transitions. [2023-11-21 22:21:48,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 782 flow [2023-11-21 22:21:48,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 139 transitions, 776 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:48,203 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 452 flow [2023-11-21 22:21:48,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2023-11-21 22:21:48,204 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-11-21 22:21:48,204 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 452 flow [2023-11-21 22:21:48,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:48,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:48,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:48,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:21:48,205 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:48,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash -909203788, now seen corresponding path program 5 times [2023-11-21 22:21:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:48,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824951321] [2023-11-21 22:21:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:48,669 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-21 22:21:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824951321] [2023-11-21 22:21:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824951321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:21:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982176892] [2023-11-21 22:21:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:48,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:21:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:48,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:21:48,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:21:48,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-21 22:21:48,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 452 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:48,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:21:48,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-21 22:21:48,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:21:52,768 INFO L124 PetriNetUnfolderBase]: 17954/30450 cut-off events. [2023-11-21 22:21:52,768 INFO L125 PetriNetUnfolderBase]: For 29488/29566 co-relation queries the response was YES. [2023-11-21 22:21:52,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77206 conditions, 30450 events. 17954/30450 cut-off events. For 29488/29566 co-relation queries the response was YES. Maximal size of possible extension queue 2300. Compared 273431 event pairs, 5579 based on Foata normal form. 58/28179 useless extension candidates. Maximal degree in co-relation 77176. Up to 12809 conditions per place. [2023-11-21 22:21:52,959 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 33 selfloop transitions, 7 changer transitions 75/147 dead transitions. [2023-11-21 22:21:52,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 147 transitions, 960 flow [2023-11-21 22:21:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:21:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:21:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 349 transitions. [2023-11-21 22:21:52,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6711538461538461 [2023-11-21 22:21:52,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 349 transitions. [2023-11-21 22:21:52,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 349 transitions. [2023-11-21 22:21:52,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:21:52,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 349 transitions. [2023-11-21 22:21:52,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:52,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:52,967 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:52,967 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 452 flow. Second operand 8 states and 349 transitions. [2023-11-21 22:21:52,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 147 transitions, 960 flow [2023-11-21 22:21:53,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 147 transitions, 954 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-21 22:21:53,050 INFO L231 Difference]: Finished difference. Result has 100 places, 65 transitions, 298 flow [2023-11-21 22:21:53,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=100, PETRI_TRANSITIONS=65} [2023-11-21 22:21:53,051 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 28 predicate places. [2023-11-21 22:21:53,051 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 65 transitions, 298 flow [2023-11-21 22:21:53,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:53,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:21:53,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:53,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:21:53,052 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:21:53,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 241288220, now seen corresponding path program 6 times [2023-11-21 22:21:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371330445] [2023-11-21 22:21:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:21:53,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:21:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:21:53,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:21:53,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:21:53,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-21 22:21:53,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-21 22:21:53,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-21 22:21:53,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-21 22:21:53,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-21 22:21:53,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-21 22:21:53,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-21 22:21:53,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-21 22:21:53,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-21 22:21:53,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-21 22:21:53,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-21 22:21:53,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-21 22:21:53,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-21 22:21:53,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-21 22:21:53,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-21 22:21:53,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-21 22:21:53,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 22:21:53,202 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:53,209 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:21:53,209 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:21:53,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:21:53,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:21:53,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 22:21:53,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 22:21:53,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:21:53,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:21:53,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:21:53 BasicIcfg [2023-11-21 22:21:53,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:21:53,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:21:53,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:21:53,374 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:21:53,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:21:27" (3/4) ... [2023-11-21 22:21:53,377 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:21:53,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:21:53,379 INFO L158 Benchmark]: Toolchain (without parser) took 27514.30ms. Allocated memory was 138.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 78.1MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 619.9MB. Max. memory is 16.1GB. [2023-11-21 22:21:53,379 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:21:53,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.23ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 78.1MB in the beginning and 129.8MB in the end (delta: -51.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-11-21 22:21:53,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.23ms. Allocated memory is still 169.9MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:21:53,381 INFO L158 Benchmark]: Boogie Preprocessor took 68.00ms. Allocated memory is still 169.9MB. Free memory was 127.7MB in the beginning and 125.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:21:53,381 INFO L158 Benchmark]: RCFGBuilder took 980.25ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 132.2MB in the end (delta: -6.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2023-11-21 22:21:53,382 INFO L158 Benchmark]: TraceAbstraction took 25634.45ms. Allocated memory was 169.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 132.2MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 640.5MB. Max. memory is 16.1GB. [2023-11-21 22:21:53,382 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 4.0GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:21:53,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.23ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 78.1MB in the beginning and 129.8MB in the end (delta: -51.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.23ms. Allocated memory is still 169.9MB. Free memory was 129.8MB in the beginning and 127.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.00ms. Allocated memory is still 169.9MB. Free memory was 127.7MB in the beginning and 125.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 980.25ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 132.2MB in the end (delta: -6.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25634.45ms. Allocated memory was 169.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 132.2MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 640.5MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 4.0GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix051_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 97 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1053 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 873 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2426 IncrementalHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 59 mSDtfsCounter, 2426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=18, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 2270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 22:21:53,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:21:56,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:21:56,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 22:21:56,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:21:56,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:21:56,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:21:56,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:21:56,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:21:56,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:21:56,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:21:56,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:21:56,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:21:56,693 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:21:56,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:21:56,696 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:21:56,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:21:56,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:21:56,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:21:56,698 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:21:56,699 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:21:56,699 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:21:56,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:21:56,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:21:56,701 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 22:21:56,701 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 22:21:56,701 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:21:56,702 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:21:56,702 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:21:56,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:21:56,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:21:56,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:21:56,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:21:56,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:21:56,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:21:56,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:21:56,707 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 22:21:56,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 22:21:56,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:21:56,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:21:56,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:21:56,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:21:56,710 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 22:21:56,710 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_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/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_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2023-11-21 22:21:57,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:21:57,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:21:57,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:21:57,190 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:21:57,190 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:21:57,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-21 22:22:00,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:22:00,999 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:22:00,999 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-21 22:22:01,040 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data/0c10c1bf6/ce0d91ca3b1c47f88371ef350620c7ae/FLAGa2045cbaa [2023-11-21 22:22:01,057 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/data/0c10c1bf6/ce0d91ca3b1c47f88371ef350620c7ae [2023-11-21 22:22:01,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:22:01,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:22:01,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:22:01,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:22:01,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:22:01,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:01,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efcc215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01, skipping insertion in model container [2023-11-21 22:22:01,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:01,130 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:22:01,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:22:01,647 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:22:01,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:22:01,844 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:22:01,845 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:22:01,854 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:22:01,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01 WrapperNode [2023-11-21 22:22:01,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:22:01,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:22:01,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:22:01,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:22:01,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:01,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:01,975 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-21 22:22:01,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:22:01,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:22:01,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:22:01,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:22:01,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:01,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:22:02,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:22:02,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:22:02,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:22:02,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (1/1) ... [2023-11-21 22:22:02,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:22:02,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:22:02,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:22:02,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:22:02,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:22:02,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:22:02,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:22:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:22:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 22:22:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 22:22:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:22:02,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:22:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:22:02,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:22:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:22:02,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:22:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 22:22:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 22:22:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:22:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:22:02,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:22:02,201 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:22:02,470 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:22:02,473 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:22:03,059 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:22:03,372 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:22:03,372 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:22:03,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:22:03 BoogieIcfgContainer [2023-11-21 22:22:03,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:22:03,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:22:03,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:22:03,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:22:03,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:22:01" (1/3) ... [2023-11-21 22:22:03,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0db99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:22:03, skipping insertion in model container [2023-11-21 22:22:03,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:22:01" (2/3) ... [2023-11-21 22:22:03,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0db99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:22:03, skipping insertion in model container [2023-11-21 22:22:03,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:22:03" (3/3) ... [2023-11-21 22:22:03,387 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-21 22:22:03,405 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:22:03,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-21 22:22:03,405 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:22:03,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:22:03,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-21 22:22:03,569 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-21 22:22:03,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:22:03,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-21 22:22:03,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-21 22:22:03,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-21 22:22:03,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:22:03,624 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;@ca9dd8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:22:03,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-21 22:22:03,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:22:03,630 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:22:03,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:22:03,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:03,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:22:03,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:22:03,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash 13060, now seen corresponding path program 1 times [2023-11-21 22:22:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:22:03,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044976583] [2023-11-21 22:22:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:22:03,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:22:03,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-21 22:22:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:03,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:22:03,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:22:03,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-11-21 22:22:03,961 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-21 22:22:03,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:22:03,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:22:03,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044976583] [2023-11-21 22:22:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044976583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:03,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:03,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:22:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944886623] [2023-11-21 22:22:03,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:22:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:04,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:04,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-21 22:22:04,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:04,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:04,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-21 22:22:04,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:04,865 INFO L124 PetriNetUnfolderBase]: 1175/2175 cut-off events. [2023-11-21 22:22:04,866 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-21 22:22:04,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2175 events. 1175/2175 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16978 event pairs, 879 based on Foata normal form. 120/2122 useless extension candidates. Maximal degree in co-relation 3897. Up to 1277 conditions per place. [2023-11-21 22:22:04,899 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-21 22:22:04,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 206 flow [2023-11-21 22:22:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:22:04,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:22:04,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:22:04,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:22:04,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:04,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:22:04,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:04,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:04,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:04,931 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:22:04,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 206 flow [2023-11-21 22:22:04,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:22:04,940 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-21 22:22:04,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-21 22:22:04,947 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-21 22:22:04,947 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-21 22:22:04,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:04,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:04,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:22:04,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:22:05,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:05,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:22:05,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 13061, now seen corresponding path program 1 times [2023-11-21 22:22:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:22:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279900104] [2023-11-21 22:22:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:22:05,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:22:05,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-21 22:22:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:05,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:22:05,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:22:05,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:22:05,333 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-21 22:22:05,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:22:05,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:22:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279900104] [2023-11-21 22:22:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279900104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:22:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878217432] [2023-11-21 22:22:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:05,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:22:05,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:05,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-21 22:22:05,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:05,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:05,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-21 22:22:05,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:06,024 INFO L124 PetriNetUnfolderBase]: 1175/2174 cut-off events. [2023-11-21 22:22:06,025 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-21 22:22:06,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3968 conditions, 2174 events. 1175/2174 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16904 event pairs, 879 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 3957. Up to 1276 conditions per place. [2023-11-21 22:22:06,056 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-21 22:22:06,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-21 22:22:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 22:22:06,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2023-11-21 22:22:06,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 22:22:06,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 22:22:06,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:06,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 22:22:06,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:06,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:06,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:06,086 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-21 22:22:06,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-21 22:22:06,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:06,097 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-21 22:22:06,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-21 22:22:06,099 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-21 22:22:06,099 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-21 22:22:06,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:06,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:06,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:22:06,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:22:06,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:06,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:22:06,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 389478527, now seen corresponding path program 1 times [2023-11-21 22:22:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:22:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430779220] [2023-11-21 22:22:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:22:06,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:22:06,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-21 22:22:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:06,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:22:06,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:22:06,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-11-21 22:22:06,455 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-21 22:22:06,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:22:06,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:22:06,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430779220] [2023-11-21 22:22:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430779220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:06,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:06,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859147373] [2023-11-21 22:22:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:06,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:22:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:06,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 65 [2023-11-21 22:22:06,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:06,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:06,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 65 [2023-11-21 22:22:06,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:22:07,092 INFO L124 PetriNetUnfolderBase]: 1176/2172 cut-off events. [2023-11-21 22:22:07,093 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-21 22:22:07,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 2172 events. 1176/2172 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16962 event pairs, 879 based on Foata normal form. 0/2003 useless extension candidates. Maximal degree in co-relation 3958. Up to 1276 conditions per place. [2023-11-21 22:22:07,121 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-21 22:22:07,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-21 22:22:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:22:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:22:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-21 22:22:07,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2023-11-21 22:22:07,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-21 22:22:07,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-21 22:22:07,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:22:07,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-21 22:22:07,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:07,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:07,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:07,131 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 144 transitions. [2023-11-21 22:22:07,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-21 22:22:07,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:22:07,140 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-21 22:22:07,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-21 22:22:07,142 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-21 22:22:07,147 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-21 22:22:07,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:07,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:22:07,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:22:07,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:22:07,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:07,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 22:22:07,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:22:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash 389478528, now seen corresponding path program 1 times [2023-11-21 22:22:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:22:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032950002] [2023-11-21 22:22:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:22:07,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:22:07,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:22:07,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:22:07,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e07dc08f-69e1-4d4d-b525-cc49775ac8d0/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-21 22:22:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:22:07,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:22:07,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:22:07,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:22:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:22:07,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:22:07,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:22:07,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032950002] [2023-11-21 22:22:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032950002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:22:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:22:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:22:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376840615] [2023-11-21 22:22:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:22:07,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:22:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:22:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:22:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:22:07,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2023-11-21 22:22:07,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:22:07,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:22:07,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2023-11-21 22:22:07,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand