./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:16:46,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:16:46,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:16:46,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:16:46,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:16:46,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:16:46,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:16:46,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:16:46,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:16:46,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:16:46,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:16:46,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:16:46,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:16:46,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:16:46,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:16:46,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:16:46,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:16:46,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:16:46,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:16:46,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:16:46,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:16:46,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:16:46,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:16:46,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:16:46,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:16:46,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:16:46,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:16:46,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:16:46,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:16:46,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:16:46,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:16:46,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:16:46,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:16:46,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:16:46,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:16:46,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:16:46,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:16:46,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:16:46,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:16:46,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:16:46,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:16:46,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:16:46,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:16:46,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:16:46,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:16:46,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:16:46,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:16:46,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:16:46,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:16:46,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:16:46,851 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:16:46,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:16:46,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:16:46,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:16:46,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:16:46,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:16:46,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:16:46,854 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:16:46,855 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:16:46,855 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:16:46,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:16:46,855 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:16:46,856 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:16:46,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:16:46,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:16:46,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:16:46,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:16:46,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:16:46,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:16:46,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:16:46,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:16:46,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:16:46,859 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:16:46,859 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:16:46,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:16:46,860 INFO L138 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_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 [2022-11-23 03:16:47,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:16:47,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:16:47,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:16:47,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:16:47,340 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:16:47,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2022-11-23 03:16:51,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:16:51,563 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:16:51,563 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2022-11-23 03:16:51,582 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data/be8710bf3/fdc61d6e494142199659dfc1be60f690/FLAG39f50d479 [2022-11-23 03:16:51,601 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data/be8710bf3/fdc61d6e494142199659dfc1be60f690 [2022-11-23 03:16:51,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:16:51,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:16:51,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:16:51,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:16:51,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:16:51,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:16:51" (1/1) ... [2022-11-23 03:16:51,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50859e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:51, skipping insertion in model container [2022-11-23 03:16:51,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:16:51" (1/1) ... [2022-11-23 03:16:51,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:16:51,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:16:51,913 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/sv-benchmarks/c/pthread-wmm/safe000_rmo.i[988,1001] [2022-11-23 03:16:52,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:16:52,362 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:16:52,377 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/sv-benchmarks/c/pthread-wmm/safe000_rmo.i[988,1001] [2022-11-23 03:16:52,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:16:52,493 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:16:52,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52 WrapperNode [2022-11-23 03:16:52,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:16:52,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:16:52,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:16:52,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:16:52,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,611 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-11-23 03:16:52,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:16:52,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:16:52,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:16:52,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:16:52,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,708 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:16:52,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:16:52,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:16:52,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:16:52,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (1/1) ... [2022-11-23 03:16:52,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:16:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:16:52,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:16:52,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:16:52,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:16:52,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:16:52,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:16:52,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:16:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:16:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:16:52,819 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:16:52,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:16:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:16:52,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:16:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:16:52,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:16:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:16:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:16:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:16:52,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:16:52,823 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:16:53,017 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:16:53,020 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:16:54,046 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:16:55,023 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:16:55,023 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:16:55,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:55 BoogieIcfgContainer [2022-11-23 03:16:55,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:16:55,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:16:55,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:16:55,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:16:55,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:16:51" (1/3) ... [2022-11-23 03:16:55,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3ffc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:16:55, skipping insertion in model container [2022-11-23 03:16:55,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:52" (2/3) ... [2022-11-23 03:16:55,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3ffc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:16:55, skipping insertion in model container [2022-11-23 03:16:55,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:55" (3/3) ... [2022-11-23 03:16:55,040 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2022-11-23 03:16:55,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:16:55,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-23 03:16:55,066 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:16:55,268 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:16:55,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 196 transitions, 407 flow [2022-11-23 03:16:55,505 INFO L130 PetriNetUnfolder]: 2/193 cut-off events. [2022-11-23 03:16:55,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:16:55,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 2/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 336 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-23 03:16:55,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 196 transitions, 407 flow [2022-11-23 03:16:55,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 193 transitions, 395 flow [2022-11-23 03:16:55,537 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:16:55,560 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 193 transitions, 395 flow [2022-11-23 03:16:55,563 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 193 transitions, 395 flow [2022-11-23 03:16:55,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 193 transitions, 395 flow [2022-11-23 03:16:55,635 INFO L130 PetriNetUnfolder]: 2/193 cut-off events. [2022-11-23 03:16:55,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:16:55,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 2/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-23 03:16:55,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 8948 [2022-11-23 03:17:46,629 INFO L134 LiptonReduction]: Checked pairs total: 35722 [2022-11-23 03:17:46,629 INFO L136 LiptonReduction]: Total number of compositions: 191 [2022-11-23 03:17:46,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:17:46,658 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;@7011b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:17:46,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2022-11-23 03:17:46,661 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 03:17:46,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:17:46,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:17:46,662 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 03:17:46,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:17:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1231, now seen corresponding path program 1 times [2022-11-23 03:17:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:46,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755100363] [2022-11-23 03:17:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:17:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:46,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755100363] [2022-11-23 03:17:46,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755100363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:17:46,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:17:46,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 03:17:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895793806] [2022-11-23 03:17:46,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:17:46,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:17:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:17:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:17:46,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:17:46,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 387 [2022-11-23 03:17:46,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 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) [2022-11-23 03:17:46,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:17:46,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 387 [2022-11-23 03:17:46,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:17:52,846 INFO L130 PetriNetUnfolder]: 13766/19444 cut-off events. [2022-11-23 03:17:52,846 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 03:17:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38883 conditions, 19444 events. 13766/19444 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1500. Compared 130557 event pairs, 13766 based on Foata normal form. 0/8273 useless extension candidates. Maximal degree in co-relation 38872. Up to 19343 conditions per place. [2022-11-23 03:17:53,025 INFO L137 encePairwiseOnDemand]: 347/387 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-11-23 03:17:53,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 189 flow [2022-11-23 03:17:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:17:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 03:17:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 350 transitions. [2022-11-23 03:17:53,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2022-11-23 03:17:53,052 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 350 transitions. [2022-11-23 03:17:53,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 350 transitions. [2022-11-23 03:17:53,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:17:53,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 350 transitions. [2022-11-23 03:17:53,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 175.0) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:53,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:53,087 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:53,089 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 350 transitions. [2022-11-23 03:17:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 189 flow [2022-11-23 03:17:53,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:17:53,101 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2022-11-23 03:17:53,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-11-23 03:17:53,108 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2022-11-23 03:17:53,109 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2022-11-23 03:17:53,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 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) [2022-11-23 03:17:53,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:17:53,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:17:53,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:17:53,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:17:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1216321, now seen corresponding path program 1 times [2022-11-23 03:17:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:53,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902828802] [2022-11-23 03:17:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:17:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:53,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902828802] [2022-11-23 03:17:53,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902828802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:17:53,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:17:53,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:17:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870182016] [2022-11-23 03:17:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:17:53,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:17:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:17:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:17:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:17:53,640 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 387 [2022-11-23 03:17:53,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:53,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:17:53,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 387 [2022-11-23 03:17:53,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:17:56,254 INFO L130 PetriNetUnfolder]: 5696/8191 cut-off events. [2022-11-23 03:17:56,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:17:56,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16385 conditions, 8191 events. 5696/8191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 49967 event pairs, 5696 based on Foata normal form. 404/4897 useless extension candidates. Maximal degree in co-relation 16382. Up to 8133 conditions per place. [2022-11-23 03:17:56,312 INFO L137 encePairwiseOnDemand]: 378/387 looper letters, 34 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-11-23 03:17:56,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 156 flow [2022-11-23 03:17:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:17:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:17:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-23 03:17:56,316 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37553832902670115 [2022-11-23 03:17:56,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-23 03:17:56,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-23 03:17:56,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:17:56,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-23 03:17:56,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:56,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:56,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:56,325 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 436 transitions. [2022-11-23 03:17:56,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 156 flow [2022-11-23 03:17:56,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:17:56,327 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2022-11-23 03:17:56,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-23 03:17:56,329 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2022-11-23 03:17:56,329 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2022-11-23 03:17:56,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:56,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:17:56,331 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:17:56,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:17:56,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:17:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1216333, now seen corresponding path program 1 times [2022-11-23 03:17:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:56,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857069795] [2022-11-23 03:17:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:17:56,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:56,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857069795] [2022-11-23 03:17:56,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857069795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:17:56,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:17:56,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:17:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284698350] [2022-11-23 03:17:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:17:56,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:17:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:17:56,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:17:56,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:17:56,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 387 [2022-11-23 03:17:56,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:56,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:17:56,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 387 [2022-11-23 03:17:56,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:17:57,986 INFO L130 PetriNetUnfolder]: 5077/7863 cut-off events. [2022-11-23 03:17:57,986 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:17:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15667 conditions, 7863 events. 5077/7863 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 49662 event pairs, 2879 based on Foata normal form. 0/5879 useless extension candidates. Maximal degree in co-relation 15663. Up to 4172 conditions per place. [2022-11-23 03:17:58,035 INFO L137 encePairwiseOnDemand]: 365/387 looper letters, 38 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2022-11-23 03:17:58,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 206 flow [2022-11-23 03:17:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:17:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:17:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-23 03:17:58,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3772609819121447 [2022-11-23 03:17:58,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-23 03:17:58,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-23 03:17:58,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:17:58,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-23 03:17:58,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:58,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:58,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:58,047 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 438 transitions. [2022-11-23 03:17:58,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 206 flow [2022-11-23 03:17:58,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:17:58,051 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 177 flow [2022-11-23 03:17:58,051 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-11-23 03:17:58,053 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2022-11-23 03:17:58,053 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 177 flow [2022-11-23 03:17:58,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:58,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:17:58,055 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:17:58,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:17:58,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:17:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1106234072, now seen corresponding path program 1 times [2022-11-23 03:17:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:58,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181239527] [2022-11-23 03:17:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:17:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:58,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181239527] [2022-11-23 03:17:58,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181239527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:17:58,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:17:58,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:17:58,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359303612] [2022-11-23 03:17:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:17:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:17:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:17:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:17:58,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:17:58,493 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 387 [2022-11-23 03:17:58,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:17:58,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:17:58,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 387 [2022-11-23 03:17:58,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:00,428 INFO L130 PetriNetUnfolder]: 4658/7627 cut-off events. [2022-11-23 03:18:00,428 INFO L131 PetriNetUnfolder]: For 2687/2823 co-relation queries the response was YES. [2022-11-23 03:18:00,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21065 conditions, 7627 events. 4658/7627 cut-off events. For 2687/2823 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 53202 event pairs, 1875 based on Foata normal form. 0/6582 useless extension candidates. Maximal degree in co-relation 21060. Up to 4131 conditions per place. [2022-11-23 03:18:00,499 INFO L137 encePairwiseOnDemand]: 383/387 looper letters, 67 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2022-11-23 03:18:00,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 433 flow [2022-11-23 03:18:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:18:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:18:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2022-11-23 03:18:00,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3944875107665805 [2022-11-23 03:18:00,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2022-11-23 03:18:00,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2022-11-23 03:18:00,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:00,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2022-11-23 03:18:00,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:00,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:00,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:00,513 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 177 flow. Second operand 3 states and 458 transitions. [2022-11-23 03:18:00,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 433 flow [2022-11-23 03:18:00,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:00,545 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 168 flow [2022-11-23 03:18:00,545 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-11-23 03:18:00,546 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -46 predicate places. [2022-11-23 03:18:00,546 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 168 flow [2022-11-23 03:18:00,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:00,547 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:00,548 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:00,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:18:00,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1106234463, now seen corresponding path program 1 times [2022-11-23 03:18:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:00,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690753214] [2022-11-23 03:18:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690753214] [2022-11-23 03:18:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690753214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:01,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:01,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:18:01,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738792434] [2022-11-23 03:18:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:01,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:18:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:18:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:18:01,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 387 [2022-11-23 03:18:01,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:01,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:01,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 387 [2022-11-23 03:18:01,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:02,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([977] L794-->L802: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_In_5 256) 0))) (let ((.cse14 (not .cse1)) (.cse16 (not (= (mod v_~y$w_buff0_used~0_Out_38 256) 0))) (.cse0 (= (mod v_~y$w_buff0_used~0_In_37 256) 0)) (.cse6 (= (mod v_~y$w_buff1_used~0_In_39 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd2~0_In_7 256) 0))) (let ((.cse10 (not .cse5)) (.cse11 (not .cse6)) (.cse15 (not .cse0)) (.cse17 (and .cse14 .cse16))) (let ((.cse2 (= (ite .cse17 0 v_~y$r_buff0_thd2~0_In_5) v_~y$r_buff0_thd2~0_Out_2)) (.cse3 (= v_~y$w_buff0_used~0_Out_38 (ite (and .cse14 .cse15) 0 v_~y$w_buff0_used~0_In_37))) (.cse4 (= (select |v_#valid_In_49| |v_~#y~0.base_In_49|) 1)) (.cse8 (select |v_#memory_int_In_45| |v_~#y~0.base_In_49|)) (.cse7 (<= (+ |v_~#y~0.offset_In_45| 4) (select |v_#length_In_45| |v_~#y~0.base_In_49|))) (.cse12 (= v_~y$w_buff1_used~0_Out_38 (ite (or (and .cse10 .cse11) .cse17) 0 v_~y$w_buff1_used~0_In_39))) (.cse13 (= (ite (or (and .cse16 (not (= 0 (mod v_~y$r_buff0_thd2~0_Out_2 256)))) (and .cse10 (not (= (mod v_~y$w_buff1_used~0_Out_38 256) 0)))) 0 v_~y$r_buff1_thd2~0_In_7) v_~y$r_buff1_thd2~0_Out_2)) (.cse9 (<= 0 |v_~#y~0.offset_In_45|))) (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4 (or (and (= |v_P1_#t~ite12_47| |v_P1_#t~mem11_50|) .cse4 (or .cse5 .cse6) .cse7 (= |v_P1_#t~mem11_50| (select .cse8 |v_~#y~0.offset_In_45|)) .cse9) (and (= |v_P1Thread1of1ForFork0_#t~mem11_9| |v_P1_#t~mem11_50|) .cse10 .cse11 (= |v_P1_#t~ite12_47| v_~y$w_buff1~0_In_39))) .cse7 (= |v_#memory_int_Out_46| (store |v_#memory_int_In_45| |v_~#y~0.base_In_49| (store .cse8 |v_~#y~0.offset_In_45| |v_P1_#t~ite12_47|))) .cse12 .cse13 .cse9) (and .cse2 .cse3 .cse4 (= |v_#memory_int_Out_46| (store |v_#memory_int_In_45| |v_~#y~0.base_In_49| (store .cse8 |v_~#y~0.offset_In_45| v_~y$w_buff0~0_In_35))) .cse14 .cse7 .cse15 .cse12 .cse13 .cse9)))))) InVars {P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_9|, ~#y~0.offset=|v_~#y~0.offset_In_45|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_37, ~#y~0.base=|v_~#y~0.base_In_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_In_7, ~y$w_buff1~0=v_~y$w_buff1~0_In_39, ~y$w_buff0~0=v_~y$w_buff0~0_In_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_5, #valid=|v_#valid_In_49|, #memory_int=|v_#memory_int_In_45|, #length=|v_#length_In_45|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_39} OutVars{~#y~0.offset=|v_~#y~0.offset_In_45|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_38, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_9|, ~#y~0.base=|v_~#y~0.base_In_49|, P1Thread1of1ForFork0_#t~ite13=|v_P1Thread1of1ForFork0_#t~ite13_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_39, ~y$w_buff0~0=v_~y$w_buff0~0_In_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, #valid=|v_#valid_In_49|, #memory_int=|v_#memory_int_Out_46|, #length=|v_#length_In_45|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_38} AuxVars[|v_P1_#t~mem11_50|, |v_P1_#t~ite12_47|] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~mem11, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite12, #memory_int, P1Thread1of1ForFork0_#t~ite13, ~y$w_buff1_used~0][21], [Black: 222#(= ~__unbuffered_p0_EAX$read_delayed~0 0), 220#true, P0Thread1of1ForFork1InUse, 149#L777true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 69#L827true, 40#L802true, 225#true, 112#ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAKtrue, 207#true, Black: 214#true, 212#(and (= |~#y~0.offset| 0) (= (select |#length| |~#y~0.base|) 4))]) [2022-11-23 03:18:02,607 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,607 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,607 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,608 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L827-->L835: Formula: (let ((.cse13 (= (mod v_~y$r_buff0_thd3~0_98 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_93 256) 0)) (.cse14 (= (mod v_~y$w_buff0_used~0_378 256) 0)) (.cse10 (not .cse13)) (.cse15 (not (= (mod v_~y$w_buff0_used~0_377 256) 0))) (.cse12 (= (mod v_~y$w_buff1_used~0_375 256) 0))) (let ((.cse3 (not .cse12)) (.cse0 (= (select |v_#valid_341| |v_~#y~0.base_376|) 1)) (.cse4 (select |v_#memory_int_403| |v_~#y~0.base_376|)) (.cse5 (<= (+ |v_~#y~0.offset_320| 4) (select |v_#length_330| |v_~#y~0.base_376|))) (.cse6 (<= 0 |v_~#y~0.offset_320|)) (.cse1 (and .cse10 .cse15)) (.cse9 (not .cse14)) (.cse2 (not .cse11))) (and .cse0 (= (ite (or .cse1 (and .cse2 .cse3)) 0 v_~y$w_buff1_used~0_375) v_~y$w_buff1_used~0_374) (= (store |v_#memory_int_403| |v_~#y~0.base_376| (store .cse4 |v_~#y~0.offset_320| |v_P2_#t~ite24_33|)) |v_#memory_int_402|) .cse5 .cse6 (let ((.cse7 (= |v_P2_#t~ite24_33| |v_P2_#t~ite23_39|)) (.cse8 (or .cse13 .cse14))) (or (and (= |v_P2_#t~mem22_32| |v_P2Thread1of1ForFork2_#t~mem22_9|) (or (and .cse2 (= v_~y$w_buff1~0_238 |v_P2_#t~ite23_39|) .cse7 .cse8 .cse3) (and .cse9 .cse10 (= |v_P2_#t~ite24_33| v_~y$w_buff0~0_232) (= |v_P2Thread1of1ForFork2_#t~ite23_9| |v_P2_#t~ite23_39|)))) (and .cse0 (= |v_P2_#t~mem22_32| (select .cse4 |v_~#y~0.offset_320|)) (= |v_P2_#t~ite23_39| |v_P2_#t~mem22_32|) .cse7 .cse8 .cse5 .cse6 (or .cse11 .cse12)))) (= v_~y$r_buff0_thd3~0_97 (ite .cse1 0 v_~y$r_buff0_thd3~0_98)) (= v_~y$w_buff0_used~0_377 (ite (and .cse9 .cse10) 0 v_~y$w_buff0_used~0_378)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_374 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_97 256) 0)) .cse15)) 0 v_~y$r_buff1_thd3~0_93) v_~y$r_buff1_thd3~0_92))))) InVars {~#y~0.offset=|v_~#y~0.offset_320|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_378, ~#y~0.base=|v_~#y~0.base_376|, P2Thread1of1ForFork2_#t~ite23=|v_P2Thread1of1ForFork2_#t~ite23_9|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_232, #valid=|v_#valid_341|, #memory_int=|v_#memory_int_403|, #length=|v_#length_330|, P2Thread1of1ForFork2_#t~mem22=|v_P2Thread1of1ForFork2_#t~mem22_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_375} OutVars{~#y~0.offset=|v_~#y~0.offset_320|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_377, ~#y~0.base=|v_~#y~0.base_376|, P2Thread1of1ForFork2_#t~ite24=|v_P2Thread1of1ForFork2_#t~ite24_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_232, #valid=|v_#valid_341|, #memory_int=|v_#memory_int_402|, #length=|v_#length_330|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_374} AuxVars[|v_P2_#t~ite24_33|, |v_P2_#t~mem22_32|, |v_P2_#t~ite23_39|] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork2_#t~mem22, ~y$w_buff1_used~0][31], [Black: 222#(= ~__unbuffered_p0_EAX$read_delayed~0 0), 220#true, 6#L794true, P0Thread1of1ForFork1InUse, 149#L777true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 225#true, 112#ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAKtrue, 96#L835true, 207#true, Black: 214#true, 212#(and (= |~#y~0.offset| 0) (= (select |#length| |~#y~0.base|) 4))]) [2022-11-23 03:18:02,609 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,609 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,609 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-11-23 03:18:02,609 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-11-23 03:18:03,089 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([977] L794-->L802: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_In_5 256) 0))) (let ((.cse14 (not .cse1)) (.cse16 (not (= (mod v_~y$w_buff0_used~0_Out_38 256) 0))) (.cse0 (= (mod v_~y$w_buff0_used~0_In_37 256) 0)) (.cse6 (= (mod v_~y$w_buff1_used~0_In_39 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd2~0_In_7 256) 0))) (let ((.cse10 (not .cse5)) (.cse11 (not .cse6)) (.cse15 (not .cse0)) (.cse17 (and .cse14 .cse16))) (let ((.cse2 (= (ite .cse17 0 v_~y$r_buff0_thd2~0_In_5) v_~y$r_buff0_thd2~0_Out_2)) (.cse3 (= v_~y$w_buff0_used~0_Out_38 (ite (and .cse14 .cse15) 0 v_~y$w_buff0_used~0_In_37))) (.cse4 (= (select |v_#valid_In_49| |v_~#y~0.base_In_49|) 1)) (.cse8 (select |v_#memory_int_In_45| |v_~#y~0.base_In_49|)) (.cse7 (<= (+ |v_~#y~0.offset_In_45| 4) (select |v_#length_In_45| |v_~#y~0.base_In_49|))) (.cse12 (= v_~y$w_buff1_used~0_Out_38 (ite (or (and .cse10 .cse11) .cse17) 0 v_~y$w_buff1_used~0_In_39))) (.cse13 (= (ite (or (and .cse16 (not (= 0 (mod v_~y$r_buff0_thd2~0_Out_2 256)))) (and .cse10 (not (= (mod v_~y$w_buff1_used~0_Out_38 256) 0)))) 0 v_~y$r_buff1_thd2~0_In_7) v_~y$r_buff1_thd2~0_Out_2)) (.cse9 (<= 0 |v_~#y~0.offset_In_45|))) (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4 (or (and (= |v_P1_#t~ite12_47| |v_P1_#t~mem11_50|) .cse4 (or .cse5 .cse6) .cse7 (= |v_P1_#t~mem11_50| (select .cse8 |v_~#y~0.offset_In_45|)) .cse9) (and (= |v_P1Thread1of1ForFork0_#t~mem11_9| |v_P1_#t~mem11_50|) .cse10 .cse11 (= |v_P1_#t~ite12_47| v_~y$w_buff1~0_In_39))) .cse7 (= |v_#memory_int_Out_46| (store |v_#memory_int_In_45| |v_~#y~0.base_In_49| (store .cse8 |v_~#y~0.offset_In_45| |v_P1_#t~ite12_47|))) .cse12 .cse13 .cse9) (and .cse2 .cse3 .cse4 (= |v_#memory_int_Out_46| (store |v_#memory_int_In_45| |v_~#y~0.base_In_49| (store .cse8 |v_~#y~0.offset_In_45| v_~y$w_buff0~0_In_35))) .cse14 .cse7 .cse15 .cse12 .cse13 .cse9)))))) InVars {P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_9|, ~#y~0.offset=|v_~#y~0.offset_In_45|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_37, ~#y~0.base=|v_~#y~0.base_In_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_In_7, ~y$w_buff1~0=v_~y$w_buff1~0_In_39, ~y$w_buff0~0=v_~y$w_buff0~0_In_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_5, #valid=|v_#valid_In_49|, #memory_int=|v_#memory_int_In_45|, #length=|v_#length_In_45|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_39} OutVars{~#y~0.offset=|v_~#y~0.offset_In_45|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_38, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_9|, ~#y~0.base=|v_~#y~0.base_In_49|, P1Thread1of1ForFork0_#t~ite13=|v_P1Thread1of1ForFork0_#t~ite13_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_39, ~y$w_buff0~0=v_~y$w_buff0~0_In_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, #valid=|v_#valid_In_49|, #memory_int=|v_#memory_int_Out_46|, #length=|v_#length_In_45|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_38} AuxVars[|v_P1_#t~mem11_50|, |v_P1_#t~ite12_47|] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~mem11, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite12, #memory_int, P1Thread1of1ForFork0_#t~ite13, ~y$w_buff1_used~0][21], [Black: 222#(= ~__unbuffered_p0_EAX$read_delayed~0 0), 220#true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 69#L827true, 40#L802true, 225#true, 112#ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAKtrue, 169#P0EXITtrue, 207#true, Black: 214#true, 212#(and (= |~#y~0.offset| 0) (= (select |#length| |~#y~0.base|) 4))]) [2022-11-23 03:18:03,090 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,090 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,090 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,090 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L827-->L835: Formula: (let ((.cse13 (= (mod v_~y$r_buff0_thd3~0_98 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_93 256) 0)) (.cse14 (= (mod v_~y$w_buff0_used~0_378 256) 0)) (.cse10 (not .cse13)) (.cse15 (not (= (mod v_~y$w_buff0_used~0_377 256) 0))) (.cse12 (= (mod v_~y$w_buff1_used~0_375 256) 0))) (let ((.cse3 (not .cse12)) (.cse0 (= (select |v_#valid_341| |v_~#y~0.base_376|) 1)) (.cse4 (select |v_#memory_int_403| |v_~#y~0.base_376|)) (.cse5 (<= (+ |v_~#y~0.offset_320| 4) (select |v_#length_330| |v_~#y~0.base_376|))) (.cse6 (<= 0 |v_~#y~0.offset_320|)) (.cse1 (and .cse10 .cse15)) (.cse9 (not .cse14)) (.cse2 (not .cse11))) (and .cse0 (= (ite (or .cse1 (and .cse2 .cse3)) 0 v_~y$w_buff1_used~0_375) v_~y$w_buff1_used~0_374) (= (store |v_#memory_int_403| |v_~#y~0.base_376| (store .cse4 |v_~#y~0.offset_320| |v_P2_#t~ite24_33|)) |v_#memory_int_402|) .cse5 .cse6 (let ((.cse7 (= |v_P2_#t~ite24_33| |v_P2_#t~ite23_39|)) (.cse8 (or .cse13 .cse14))) (or (and (= |v_P2_#t~mem22_32| |v_P2Thread1of1ForFork2_#t~mem22_9|) (or (and .cse2 (= v_~y$w_buff1~0_238 |v_P2_#t~ite23_39|) .cse7 .cse8 .cse3) (and .cse9 .cse10 (= |v_P2_#t~ite24_33| v_~y$w_buff0~0_232) (= |v_P2Thread1of1ForFork2_#t~ite23_9| |v_P2_#t~ite23_39|)))) (and .cse0 (= |v_P2_#t~mem22_32| (select .cse4 |v_~#y~0.offset_320|)) (= |v_P2_#t~ite23_39| |v_P2_#t~mem22_32|) .cse7 .cse8 .cse5 .cse6 (or .cse11 .cse12)))) (= v_~y$r_buff0_thd3~0_97 (ite .cse1 0 v_~y$r_buff0_thd3~0_98)) (= v_~y$w_buff0_used~0_377 (ite (and .cse9 .cse10) 0 v_~y$w_buff0_used~0_378)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_374 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_97 256) 0)) .cse15)) 0 v_~y$r_buff1_thd3~0_93) v_~y$r_buff1_thd3~0_92))))) InVars {~#y~0.offset=|v_~#y~0.offset_320|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_378, ~#y~0.base=|v_~#y~0.base_376|, P2Thread1of1ForFork2_#t~ite23=|v_P2Thread1of1ForFork2_#t~ite23_9|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_232, #valid=|v_#valid_341|, #memory_int=|v_#memory_int_403|, #length=|v_#length_330|, P2Thread1of1ForFork2_#t~mem22=|v_P2Thread1of1ForFork2_#t~mem22_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_375} OutVars{~#y~0.offset=|v_~#y~0.offset_320|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_377, ~#y~0.base=|v_~#y~0.base_376|, P2Thread1of1ForFork2_#t~ite24=|v_P2Thread1of1ForFork2_#t~ite24_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_232, #valid=|v_#valid_341|, #memory_int=|v_#memory_int_402|, #length=|v_#length_330|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_374} AuxVars[|v_P2_#t~ite24_33|, |v_P2_#t~mem22_32|, |v_P2_#t~ite23_39|] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork2_#t~mem22, ~y$w_buff1_used~0][31], [Black: 222#(= ~__unbuffered_p0_EAX$read_delayed~0 0), 220#true, 6#L794true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 225#true, 112#ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAKtrue, 96#L835true, 169#P0EXITtrue, 207#true, Black: 214#true, 212#(and (= |~#y~0.offset| 0) (= (select |#length| |~#y~0.base|) 4))]) [2022-11-23 03:18:03,092 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,092 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,092 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,092 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-23 03:18:03,658 INFO L130 PetriNetUnfolder]: 4731/7454 cut-off events. [2022-11-23 03:18:03,658 INFO L131 PetriNetUnfolder]: For 2134/2298 co-relation queries the response was YES. [2022-11-23 03:18:03,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20634 conditions, 7454 events. 4731/7454 cut-off events. For 2134/2298 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 49092 event pairs, 2352 based on Foata normal form. 0/5762 useless extension candidates. Maximal degree in co-relation 20628. Up to 6347 conditions per place. [2022-11-23 03:18:03,727 INFO L137 encePairwiseOnDemand]: 380/387 looper letters, 66 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2022-11-23 03:18:03,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 470 flow [2022-11-23 03:18:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:18:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:18:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-11-23 03:18:03,730 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3669250645994832 [2022-11-23 03:18:03,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-11-23 03:18:03,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-11-23 03:18:03,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:03,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-11-23 03:18:03,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:03,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:03,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:03,739 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 168 flow. Second operand 4 states and 568 transitions. [2022-11-23 03:18:03,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 470 flow [2022-11-23 03:18:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:03,743 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 263 flow [2022-11-23 03:18:03,744 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2022-11-23 03:18:03,744 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -43 predicate places. [2022-11-23 03:18:03,745 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 263 flow [2022-11-23 03:18:03,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:03,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:03,746 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:03,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:18:03,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1611175572, now seen corresponding path program 1 times [2022-11-23 03:18:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:03,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903787715] [2022-11-23 03:18:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:05,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:05,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903787715] [2022-11-23 03:18:05,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903787715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:05,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:05,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:18:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990578519] [2022-11-23 03:18:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:05,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:18:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:18:05,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:18:05,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 387 [2022-11-23 03:18:05,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:05,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:05,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 387 [2022-11-23 03:18:05,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:06,793 INFO L130 PetriNetUnfolder]: 4578/7293 cut-off events. [2022-11-23 03:18:06,794 INFO L131 PetriNetUnfolder]: For 3034/3107 co-relation queries the response was YES. [2022-11-23 03:18:06,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21870 conditions, 7293 events. 4578/7293 cut-off events. For 3034/3107 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 49269 event pairs, 1124 based on Foata normal form. 28/5743 useless extension candidates. Maximal degree in co-relation 21862. Up to 5616 conditions per place. [2022-11-23 03:18:06,839 INFO L137 encePairwiseOnDemand]: 384/387 looper letters, 71 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2022-11-23 03:18:06,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 507 flow [2022-11-23 03:18:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:18:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:18:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2022-11-23 03:18:06,843 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3875968992248062 [2022-11-23 03:18:06,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2022-11-23 03:18:06,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2022-11-23 03:18:06,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:06,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2022-11-23 03:18:06,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:06,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:06,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:06,851 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 263 flow. Second operand 3 states and 450 transitions. [2022-11-23 03:18:06,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 507 flow [2022-11-23 03:18:06,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 507 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:18:06,864 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 277 flow [2022-11-23 03:18:06,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2022-11-23 03:18:06,865 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -40 predicate places. [2022-11-23 03:18:06,866 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 277 flow [2022-11-23 03:18:06,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:06,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:06,867 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:06,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:18:06,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:06,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1611175181, now seen corresponding path program 1 times [2022-11-23 03:18:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:06,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486127727] [2022-11-23 03:18:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:06,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:07,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486127727] [2022-11-23 03:18:07,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486127727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:07,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:07,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:18:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095625701] [2022-11-23 03:18:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:07,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:18:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:18:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:18:07,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 387 [2022-11-23 03:18:07,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:07,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:07,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 387 [2022-11-23 03:18:07,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:09,133 INFO L130 PetriNetUnfolder]: 4805/7483 cut-off events. [2022-11-23 03:18:09,133 INFO L131 PetriNetUnfolder]: For 3068/3068 co-relation queries the response was YES. [2022-11-23 03:18:09,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23798 conditions, 7483 events. 4805/7483 cut-off events. For 3068/3068 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 47599 event pairs, 2326 based on Foata normal form. 0/6012 useless extension candidates. Maximal degree in co-relation 23788. Up to 2886 conditions per place. [2022-11-23 03:18:09,179 INFO L137 encePairwiseOnDemand]: 376/387 looper letters, 79 selfloop transitions, 15 changer transitions 0/95 dead transitions. [2022-11-23 03:18:09,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 608 flow [2022-11-23 03:18:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:18:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:18:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2022-11-23 03:18:09,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3649870801033592 [2022-11-23 03:18:09,183 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2022-11-23 03:18:09,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2022-11-23 03:18:09,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:09,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2022-11-23 03:18:09,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:09,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:09,191 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:09,191 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 277 flow. Second operand 4 states and 565 transitions. [2022-11-23 03:18:09,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 608 flow [2022-11-23 03:18:09,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:09,214 INFO L231 Difference]: Finished difference. Result has 59 places, 65 transitions, 377 flow [2022-11-23 03:18:09,214 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=59, PETRI_TRANSITIONS=65} [2022-11-23 03:18:09,215 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2022-11-23 03:18:09,215 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 65 transitions, 377 flow [2022-11-23 03:18:09,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:09,216 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:09,216 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:09,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:18:09,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1611175182, now seen corresponding path program 1 times [2022-11-23 03:18:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:09,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660352634] [2022-11-23 03:18:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:09,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660352634] [2022-11-23 03:18:09,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660352634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:09,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:09,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:18:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549167130] [2022-11-23 03:18:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:09,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:18:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:09,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:18:09,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:18:09,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 387 [2022-11-23 03:18:09,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 65 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:09,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:09,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 387 [2022-11-23 03:18:09,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:11,206 INFO L130 PetriNetUnfolder]: 4652/7280 cut-off events. [2022-11-23 03:18:11,206 INFO L131 PetriNetUnfolder]: For 8460/8460 co-relation queries the response was YES. [2022-11-23 03:18:11,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25531 conditions, 7280 events. 4652/7280 cut-off events. For 8460/8460 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 46354 event pairs, 2669 based on Foata normal form. 50/6531 useless extension candidates. Maximal degree in co-relation 25519. Up to 4262 conditions per place. [2022-11-23 03:18:11,255 INFO L137 encePairwiseOnDemand]: 384/387 looper letters, 78 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2022-11-23 03:18:11,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 629 flow [2022-11-23 03:18:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:18:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:18:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-11-23 03:18:11,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36175710594315247 [2022-11-23 03:18:11,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-11-23 03:18:11,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-11-23 03:18:11,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:11,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-11-23 03:18:11,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:11,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:11,268 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:11,268 INFO L175 Difference]: Start difference. First operand has 59 places, 65 transitions, 377 flow. Second operand 4 states and 560 transitions. [2022-11-23 03:18:11,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 629 flow [2022-11-23 03:18:11,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:11,359 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 374 flow [2022-11-23 03:18:11,359 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2022-11-23 03:18:11,360 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2022-11-23 03:18:11,360 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 374 flow [2022-11-23 03:18:11,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:11,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:11,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:11,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:18:11,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 363663578, now seen corresponding path program 1 times [2022-11-23 03:18:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:11,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193879853] [2022-11-23 03:18:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:12,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193879853] [2022-11-23 03:18:12,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193879853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:12,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:12,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:18:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464524367] [2022-11-23 03:18:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:12,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:18:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:18:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:18:12,148 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 387 [2022-11-23 03:18:12,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:12,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:12,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 387 [2022-11-23 03:18:12,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:13,429 INFO L130 PetriNetUnfolder]: 4378/6983 cut-off events. [2022-11-23 03:18:13,429 INFO L131 PetriNetUnfolder]: For 8580/8613 co-relation queries the response was YES. [2022-11-23 03:18:13,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24176 conditions, 6983 events. 4378/6983 cut-off events. For 8580/8613 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 45472 event pairs, 1485 based on Foata normal form. 11/6163 useless extension candidates. Maximal degree in co-relation 24165. Up to 4819 conditions per place. [2022-11-23 03:18:13,540 INFO L137 encePairwiseOnDemand]: 384/387 looper letters, 84 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2022-11-23 03:18:13,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 767 flow [2022-11-23 03:18:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:18:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:18:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2022-11-23 03:18:13,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3858742463393626 [2022-11-23 03:18:13,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2022-11-23 03:18:13,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2022-11-23 03:18:13,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:13,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2022-11-23 03:18:13,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:13,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:13,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:13,549 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 374 flow. Second operand 3 states and 448 transitions. [2022-11-23 03:18:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 767 flow [2022-11-23 03:18:13,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:13,649 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 380 flow [2022-11-23 03:18:13,649 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2022-11-23 03:18:13,650 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -37 predicate places. [2022-11-23 03:18:13,650 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 380 flow [2022-11-23 03:18:13,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:13,651 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:13,651 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:13,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:18:13,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1611332747, now seen corresponding path program 1 times [2022-11-23 03:18:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:13,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135307752] [2022-11-23 03:18:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:14,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135307752] [2022-11-23 03:18:14,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135307752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:14,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:14,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:18:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429566780] [2022-11-23 03:18:14,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:18:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:18:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:18:14,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 387 [2022-11-23 03:18:14,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:14,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:14,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 387 [2022-11-23 03:18:14,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:16,396 INFO L130 PetriNetUnfolder]: 5694/8866 cut-off events. [2022-11-23 03:18:16,396 INFO L131 PetriNetUnfolder]: For 9694/9767 co-relation queries the response was YES. [2022-11-23 03:18:16,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31016 conditions, 8866 events. 5694/8866 cut-off events. For 9694/9767 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 56253 event pairs, 2370 based on Foata normal form. 14/7776 useless extension candidates. Maximal degree in co-relation 31004. Up to 5576 conditions per place. [2022-11-23 03:18:16,450 INFO L137 encePairwiseOnDemand]: 381/387 looper letters, 75 selfloop transitions, 18 changer transitions 0/101 dead transitions. [2022-11-23 03:18:16,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 723 flow [2022-11-23 03:18:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:18:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:18:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2022-11-23 03:18:16,454 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3624031007751938 [2022-11-23 03:18:16,454 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2022-11-23 03:18:16,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2022-11-23 03:18:16,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:16,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2022-11-23 03:18:16,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:16,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:16,461 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:16,462 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 380 flow. Second operand 4 states and 561 transitions. [2022-11-23 03:18:16,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 723 flow [2022-11-23 03:18:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:16,557 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 457 flow [2022-11-23 03:18:16,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=457, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2022-11-23 03:18:16,558 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2022-11-23 03:18:16,559 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 457 flow [2022-11-23 03:18:16,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:16,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:16,560 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:16,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:18:16,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2060540605, now seen corresponding path program 1 times [2022-11-23 03:18:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:16,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156005051] [2022-11-23 03:18:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:16,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156005051] [2022-11-23 03:18:16,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156005051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:16,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:16,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:18:16,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975725861] [2022-11-23 03:18:16,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:16,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:18:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:16,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:18:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:18:16,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 387 [2022-11-23 03:18:16,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:16,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:16,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 387 [2022-11-23 03:18:16,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:18,257 INFO L130 PetriNetUnfolder]: 3880/6075 cut-off events. [2022-11-23 03:18:18,257 INFO L131 PetriNetUnfolder]: For 7787/7787 co-relation queries the response was YES. [2022-11-23 03:18:18,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24022 conditions, 6075 events. 3880/6075 cut-off events. For 7787/7787 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 37422 event pairs, 1474 based on Foata normal form. 100/5444 useless extension candidates. Maximal degree in co-relation 24009. Up to 2653 conditions per place. [2022-11-23 03:18:18,301 INFO L137 encePairwiseOnDemand]: 369/387 looper letters, 74 selfloop transitions, 24 changer transitions 0/99 dead transitions. [2022-11-23 03:18:18,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 848 flow [2022-11-23 03:18:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:18:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:18:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-11-23 03:18:18,304 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35658914728682173 [2022-11-23 03:18:18,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-11-23 03:18:18,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-11-23 03:18:18,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:18,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-11-23 03:18:18,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:18,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:18,311 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:18,311 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 457 flow. Second operand 4 states and 552 transitions. [2022-11-23 03:18:18,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 848 flow [2022-11-23 03:18:18,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:18:18,388 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 659 flow [2022-11-23 03:18:18,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=659, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2022-11-23 03:18:18,389 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2022-11-23 03:18:18,389 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 659 flow [2022-11-23 03:18:18,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:18,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:18,390 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:18,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:18:18,391 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:18,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1565556614, now seen corresponding path program 1 times [2022-11-23 03:18:18,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:18,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354008372] [2022-11-23 03:18:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:19,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354008372] [2022-11-23 03:18:19,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354008372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:19,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:19,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:18:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945376902] [2022-11-23 03:18:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:19,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:18:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:18:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:18:19,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 387 [2022-11-23 03:18:19,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 659 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:19,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:19,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 387 [2022-11-23 03:18:19,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:21,467 INFO L130 PetriNetUnfolder]: 6221/9759 cut-off events. [2022-11-23 03:18:21,467 INFO L131 PetriNetUnfolder]: For 23329/23767 co-relation queries the response was YES. [2022-11-23 03:18:21,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40532 conditions, 9759 events. 6221/9759 cut-off events. For 23329/23767 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 66076 event pairs, 1536 based on Foata normal form. 169/8461 useless extension candidates. Maximal degree in co-relation 40518. Up to 3625 conditions per place. [2022-11-23 03:18:21,532 INFO L137 encePairwiseOnDemand]: 383/387 looper letters, 128 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2022-11-23 03:18:21,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1330 flow [2022-11-23 03:18:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:18:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:18:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2022-11-23 03:18:21,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3863049095607235 [2022-11-23 03:18:21,535 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2022-11-23 03:18:21,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2022-11-23 03:18:21,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:21,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2022-11-23 03:18:21,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:21,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:21,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:21,543 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 659 flow. Second operand 4 states and 598 transitions. [2022-11-23 03:18:21,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1330 flow [2022-11-23 03:18:21,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 1322 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:18:21,672 INFO L231 Difference]: Finished difference. Result has 70 places, 81 transitions, 676 flow [2022-11-23 03:18:21,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=676, PETRI_PLACES=70, PETRI_TRANSITIONS=81} [2022-11-23 03:18:21,673 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -27 predicate places. [2022-11-23 03:18:21,673 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 81 transitions, 676 flow [2022-11-23 03:18:21,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:21,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:21,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:21,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:18:21,674 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash 547750555, now seen corresponding path program 1 times [2022-11-23 03:18:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:21,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32369623] [2022-11-23 03:18:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32369623] [2022-11-23 03:18:22,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32369623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:22,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:22,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:18:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951606779] [2022-11-23 03:18:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:22,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:18:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:22,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:18:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:18:23,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 387 [2022-11-23 03:18:23,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 81 transitions, 676 flow. Second operand has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:23,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:23,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 387 [2022-11-23 03:18:23,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:26,331 INFO L130 PetriNetUnfolder]: 6383/10208 cut-off events. [2022-11-23 03:18:26,332 INFO L131 PetriNetUnfolder]: For 19790/20049 co-relation queries the response was YES. [2022-11-23 03:18:26,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41779 conditions, 10208 events. 6383/10208 cut-off events. For 19790/20049 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 71151 event pairs, 2750 based on Foata normal form. 14/9241 useless extension candidates. Maximal degree in co-relation 41762. Up to 5750 conditions per place. [2022-11-23 03:18:26,420 INFO L137 encePairwiseOnDemand]: 379/387 looper letters, 121 selfloop transitions, 24 changer transitions 0/158 dead transitions. [2022-11-23 03:18:26,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 158 transitions, 1387 flow [2022-11-23 03:18:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:18:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:18:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1151 transitions. [2022-11-23 03:18:26,426 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3304622451909274 [2022-11-23 03:18:26,427 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1151 transitions. [2022-11-23 03:18:26,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1151 transitions. [2022-11-23 03:18:26,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:26,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1151 transitions. [2022-11-23 03:18:26,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.88888888888889) internal successors, (1151), 9 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:26,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 387.0) internal successors, (3870), 10 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:26,440 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 387.0) internal successors, (3870), 10 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:26,440 INFO L175 Difference]: Start difference. First operand has 70 places, 81 transitions, 676 flow. Second operand 9 states and 1151 transitions. [2022-11-23 03:18:26,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 158 transitions, 1387 flow [2022-11-23 03:18:26,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 158 transitions, 1372 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:26,666 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 855 flow [2022-11-23 03:18:26,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=855, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2022-11-23 03:18:26,667 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -16 predicate places. [2022-11-23 03:18:26,667 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 855 flow [2022-11-23 03:18:26,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:26,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:26,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:26,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:18:26,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash 547750475, now seen corresponding path program 1 times [2022-11-23 03:18:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:26,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391833543] [2022-11-23 03:18:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:27,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391833543] [2022-11-23 03:18:27,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391833543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:27,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:27,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:18:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608872785] [2022-11-23 03:18:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:27,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:18:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:18:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:18:27,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 387 [2022-11-23 03:18:27,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 855 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:27,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:27,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 387 [2022-11-23 03:18:27,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:29,132 INFO L130 PetriNetUnfolder]: 5254/8297 cut-off events. [2022-11-23 03:18:29,132 INFO L131 PetriNetUnfolder]: For 16035/16067 co-relation queries the response was YES. [2022-11-23 03:18:29,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33636 conditions, 8297 events. 5254/8297 cut-off events. For 16035/16067 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 53435 event pairs, 2442 based on Foata normal form. 270/8227 useless extension candidates. Maximal degree in co-relation 33614. Up to 3949 conditions per place. [2022-11-23 03:18:29,188 INFO L137 encePairwiseOnDemand]: 368/387 looper letters, 96 selfloop transitions, 31 changer transitions 1/129 dead transitions. [2022-11-23 03:18:29,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 129 transitions, 1323 flow [2022-11-23 03:18:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:18:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:18:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2022-11-23 03:18:29,192 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.33936261843238585 [2022-11-23 03:18:29,192 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2022-11-23 03:18:29,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2022-11-23 03:18:29,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:29,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2022-11-23 03:18:29,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:29,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:29,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:29,201 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 855 flow. Second operand 6 states and 788 transitions. [2022-11-23 03:18:29,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 129 transitions, 1323 flow [2022-11-23 03:18:29,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 129 transitions, 1317 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-23 03:18:29,338 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 1075 flow [2022-11-23 03:18:29,338 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1075, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2022-11-23 03:18:29,339 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -9 predicate places. [2022-11-23 03:18:29,340 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1075 flow [2022-11-23 03:18:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:29,340 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:29,340 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:29,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:18:29,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1264997498, now seen corresponding path program 1 times [2022-11-23 03:18:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:29,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584027080] [2022-11-23 03:18:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584027080] [2022-11-23 03:18:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584027080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:30,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:30,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:18:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212767550] [2022-11-23 03:18:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:30,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:18:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:18:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:18:31,367 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 387 [2022-11-23 03:18:31,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1075 flow. Second operand has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:31,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:31,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 387 [2022-11-23 03:18:31,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:34,136 INFO L130 PetriNetUnfolder]: 7128/11392 cut-off events. [2022-11-23 03:18:34,136 INFO L131 PetriNetUnfolder]: For 29038/29086 co-relation queries the response was YES. [2022-11-23 03:18:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50310 conditions, 11392 events. 7128/11392 cut-off events. For 29038/29086 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 79320 event pairs, 2096 based on Foata normal form. 80/10878 useless extension candidates. Maximal degree in co-relation 50286. Up to 7991 conditions per place. [2022-11-23 03:18:34,238 INFO L137 encePairwiseOnDemand]: 377/387 looper letters, 155 selfloop transitions, 21 changer transitions 0/177 dead transitions. [2022-11-23 03:18:34,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 177 transitions, 1946 flow [2022-11-23 03:18:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:18:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-23 03:18:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1222 transitions. [2022-11-23 03:18:34,244 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3157622739018088 [2022-11-23 03:18:34,244 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1222 transitions. [2022-11-23 03:18:34,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1222 transitions. [2022-11-23 03:18:34,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:34,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1222 transitions. [2022-11-23 03:18:34,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.2) internal successors, (1222), 10 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:34,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 387.0) internal successors, (4257), 11 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:34,260 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 387.0) internal successors, (4257), 11 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:34,260 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1075 flow. Second operand 10 states and 1222 transitions. [2022-11-23 03:18:34,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 177 transitions, 1946 flow [2022-11-23 03:18:34,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 177 transitions, 1849 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-23 03:18:34,706 INFO L231 Difference]: Finished difference. Result has 97 places, 118 transitions, 1189 flow [2022-11-23 03:18:34,707 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1189, PETRI_PLACES=97, PETRI_TRANSITIONS=118} [2022-11-23 03:18:34,707 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2022-11-23 03:18:34,708 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 118 transitions, 1189 flow [2022-11-23 03:18:34,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:34,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:34,709 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:34,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 03:18:34,709 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash -574729012, now seen corresponding path program 2 times [2022-11-23 03:18:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:34,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719683019] [2022-11-23 03:18:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719683019] [2022-11-23 03:18:36,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719683019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:36,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:36,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:18:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106615518] [2022-11-23 03:18:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:36,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:18:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:18:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:18:36,709 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 387 [2022-11-23 03:18:36,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 118 transitions, 1189 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:36,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:36,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 387 [2022-11-23 03:18:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:39,570 INFO L130 PetriNetUnfolder]: 7684/12404 cut-off events. [2022-11-23 03:18:39,570 INFO L131 PetriNetUnfolder]: For 27089/27112 co-relation queries the response was YES. [2022-11-23 03:18:39,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55183 conditions, 12404 events. 7684/12404 cut-off events. For 27089/27112 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 89851 event pairs, 3843 based on Foata normal form. 39/11809 useless extension candidates. Maximal degree in co-relation 55155. Up to 9849 conditions per place. [2022-11-23 03:18:39,681 INFO L137 encePairwiseOnDemand]: 380/387 looper letters, 128 selfloop transitions, 40 changer transitions 0/171 dead transitions. [2022-11-23 03:18:39,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 171 transitions, 1946 flow [2022-11-23 03:18:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:18:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:18:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2022-11-23 03:18:39,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3607235142118863 [2022-11-23 03:18:39,685 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2022-11-23 03:18:39,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2022-11-23 03:18:39,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:39,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2022-11-23 03:18:39,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:39,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:39,692 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:39,692 INFO L175 Difference]: Start difference. First operand has 97 places, 118 transitions, 1189 flow. Second operand 5 states and 698 transitions. [2022-11-23 03:18:39,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 171 transitions, 1946 flow [2022-11-23 03:18:40,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 171 transitions, 1912 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:40,077 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 1455 flow [2022-11-23 03:18:40,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1455, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2022-11-23 03:18:40,078 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places. [2022-11-23 03:18:40,078 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 1455 flow [2022-11-23 03:18:40,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:40,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:40,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:40,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 03:18:40,080 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2022109114, now seen corresponding path program 1 times [2022-11-23 03:18:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:40,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999843112] [2022-11-23 03:18:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:40,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999843112] [2022-11-23 03:18:40,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999843112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:40,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:40,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:18:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007426469] [2022-11-23 03:18:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:40,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:18:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:40,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:18:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:18:41,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 387 [2022-11-23 03:18:41,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 1455 flow. Second operand has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:41,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:41,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 387 [2022-11-23 03:18:41,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:44,376 INFO L130 PetriNetUnfolder]: 6642/10424 cut-off events. [2022-11-23 03:18:44,376 INFO L131 PetriNetUnfolder]: For 35365/35396 co-relation queries the response was YES. [2022-11-23 03:18:44,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49063 conditions, 10424 events. 6642/10424 cut-off events. For 35365/35396 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 69327 event pairs, 1815 based on Foata normal form. 31/10289 useless extension candidates. Maximal degree in co-relation 49033. Up to 3801 conditions per place. [2022-11-23 03:18:44,455 INFO L137 encePairwiseOnDemand]: 380/387 looper letters, 159 selfloop transitions, 23 changer transitions 3/186 dead transitions. [2022-11-23 03:18:44,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 186 transitions, 2147 flow [2022-11-23 03:18:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:18:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:18:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2022-11-23 03:18:44,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3211517165005537 [2022-11-23 03:18:44,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2022-11-23 03:18:44,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2022-11-23 03:18:44,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:44,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2022-11-23 03:18:44,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:44,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 387.0) internal successors, (3096), 8 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:44,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 387.0) internal successors, (3096), 8 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:44,469 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 1455 flow. Second operand 7 states and 870 transitions. [2022-11-23 03:18:44,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 186 transitions, 2147 flow [2022-11-23 03:18:44,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 186 transitions, 2110 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-23 03:18:44,872 INFO L231 Difference]: Finished difference. Result has 104 places, 130 transitions, 1446 flow [2022-11-23 03:18:44,872 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1446, PETRI_PLACES=104, PETRI_TRANSITIONS=130} [2022-11-23 03:18:44,872 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, 7 predicate places. [2022-11-23 03:18:44,873 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 130 transitions, 1446 flow [2022-11-23 03:18:44,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:44,874 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:44,874 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:44,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 03:18:44,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1861275142, now seen corresponding path program 3 times [2022-11-23 03:18:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366340196] [2022-11-23 03:18:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366340196] [2022-11-23 03:18:45,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366340196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:45,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:45,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:18:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952562911] [2022-11-23 03:18:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:45,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:18:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:18:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:18:46,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 387 [2022-11-23 03:18:46,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 130 transitions, 1446 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:46,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:46,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 387 [2022-11-23 03:18:46,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:49,950 INFO L130 PetriNetUnfolder]: 8757/13926 cut-off events. [2022-11-23 03:18:49,951 INFO L131 PetriNetUnfolder]: For 50133/50169 co-relation queries the response was YES. [2022-11-23 03:18:50,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67511 conditions, 13926 events. 8757/13926 cut-off events. For 50133/50169 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 99632 event pairs, 1285 based on Foata normal form. 68/13740 useless extension candidates. Maximal degree in co-relation 67481. Up to 6371 conditions per place. [2022-11-23 03:18:50,079 INFO L137 encePairwiseOnDemand]: 377/387 looper letters, 216 selfloop transitions, 61 changer transitions 0/278 dead transitions. [2022-11-23 03:18:50,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 278 transitions, 3372 flow [2022-11-23 03:18:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:18:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 03:18:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1491 transitions. [2022-11-23 03:18:50,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3210594315245478 [2022-11-23 03:18:50,086 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1491 transitions. [2022-11-23 03:18:50,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1491 transitions. [2022-11-23 03:18:50,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:50,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1491 transitions. [2022-11-23 03:18:50,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 124.25) internal successors, (1491), 12 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:50,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 387.0) internal successors, (5031), 13 states have internal predecessors, (5031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:50,093 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 387.0) internal successors, (5031), 13 states have internal predecessors, (5031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:50,093 INFO L175 Difference]: Start difference. First operand has 104 places, 130 transitions, 1446 flow. Second operand 12 states and 1491 transitions. [2022-11-23 03:18:50,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 278 transitions, 3372 flow [2022-11-23 03:18:50,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 278 transitions, 3290 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-23 03:18:50,874 INFO L231 Difference]: Finished difference. Result has 116 places, 172 transitions, 2120 flow [2022-11-23 03:18:50,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2120, PETRI_PLACES=116, PETRI_TRANSITIONS=172} [2022-11-23 03:18:50,875 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places. [2022-11-23 03:18:50,876 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 172 transitions, 2120 flow [2022-11-23 03:18:50,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:50,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:50,877 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:50,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 03:18:50,877 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash -282266682, now seen corresponding path program 4 times [2022-11-23 03:18:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:50,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096286319] [2022-11-23 03:18:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:52,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:52,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096286319] [2022-11-23 03:18:52,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096286319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:52,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:52,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:18:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832635054] [2022-11-23 03:18:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:52,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:18:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:18:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:18:52,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 387 [2022-11-23 03:18:52,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 172 transitions, 2120 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:52,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:52,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 387 [2022-11-23 03:18:52,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:18:56,273 INFO L130 PetriNetUnfolder]: 9168/14508 cut-off events. [2022-11-23 03:18:56,273 INFO L131 PetriNetUnfolder]: For 63984/64014 co-relation queries the response was YES. [2022-11-23 03:18:56,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74781 conditions, 14508 events. 9168/14508 cut-off events. For 63984/64014 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 103741 event pairs, 3705 based on Foata normal form. 32/14408 useless extension candidates. Maximal degree in co-relation 74744. Up to 12740 conditions per place. [2022-11-23 03:18:56,410 INFO L137 encePairwiseOnDemand]: 376/387 looper letters, 186 selfloop transitions, 83 changer transitions 0/272 dead transitions. [2022-11-23 03:18:56,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 272 transitions, 3832 flow [2022-11-23 03:18:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:18:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:18:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2022-11-23 03:18:56,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.358656330749354 [2022-11-23 03:18:56,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2022-11-23 03:18:56,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2022-11-23 03:18:56,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:18:56,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2022-11-23 03:18:56,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:56,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:56,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:56,419 INFO L175 Difference]: Start difference. First operand has 116 places, 172 transitions, 2120 flow. Second operand 5 states and 694 transitions. [2022-11-23 03:18:56,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 272 transitions, 3832 flow [2022-11-23 03:18:57,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 272 transitions, 3767 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-11-23 03:18:57,268 INFO L231 Difference]: Finished difference. Result has 118 places, 233 transitions, 3222 flow [2022-11-23 03:18:57,268 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3222, PETRI_PLACES=118, PETRI_TRANSITIONS=233} [2022-11-23 03:18:57,268 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2022-11-23 03:18:57,268 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 233 transitions, 3222 flow [2022-11-23 03:18:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:57,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:18:57,269 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:18:57,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 03:18:57,269 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:18:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:18:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -199599978, now seen corresponding path program 1 times [2022-11-23 03:18:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:18:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446427755] [2022-11-23 03:18:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:18:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:18:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:18:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:18:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:18:57,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446427755] [2022-11-23 03:18:57,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446427755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:18:57,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:18:57,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:18:57,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058470272] [2022-11-23 03:18:57,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:18:57,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:18:57,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:18:57,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:18:57,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:18:57,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 387 [2022-11-23 03:18:57,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 233 transitions, 3222 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:18:57,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:18:57,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 387 [2022-11-23 03:18:57,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:00,476 INFO L130 PetriNetUnfolder]: 8203/12396 cut-off events. [2022-11-23 03:19:00,477 INFO L131 PetriNetUnfolder]: For 65985/66015 co-relation queries the response was YES. [2022-11-23 03:19:00,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68060 conditions, 12396 events. 8203/12396 cut-off events. For 65985/66015 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 80437 event pairs, 3281 based on Foata normal form. 440/12836 useless extension candidates. Maximal degree in co-relation 68021. Up to 10068 conditions per place. [2022-11-23 03:19:00,589 INFO L137 encePairwiseOnDemand]: 370/387 looper letters, 52 selfloop transitions, 1 changer transitions 178/232 dead transitions. [2022-11-23 03:19:00,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 232 transitions, 3652 flow [2022-11-23 03:19:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:19:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:19:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2022-11-23 03:19:00,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3462532299741602 [2022-11-23 03:19:00,594 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2022-11-23 03:19:00,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2022-11-23 03:19:00,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:00,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2022-11-23 03:19:00,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:00,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:00,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:00,600 INFO L175 Difference]: Start difference. First operand has 118 places, 233 transitions, 3222 flow. Second operand 4 states and 536 transitions. [2022-11-23 03:19:00,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 232 transitions, 3652 flow [2022-11-23 03:19:01,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 232 transitions, 3576 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-11-23 03:19:01,490 INFO L231 Difference]: Finished difference. Result has 111 places, 54 transitions, 580 flow [2022-11-23 03:19:01,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=3090, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=580, PETRI_PLACES=111, PETRI_TRANSITIONS=54} [2022-11-23 03:19:01,491 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, 14 predicate places. [2022-11-23 03:19:01,491 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 54 transitions, 580 flow [2022-11-23 03:19:01,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:01,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:01,491 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:01,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 03:19:01,492 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash 473569193, now seen corresponding path program 1 times [2022-11-23 03:19:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:01,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198211184] [2022-11-23 03:19:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198211184] [2022-11-23 03:19:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198211184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:03,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:03,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:19:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510005052] [2022-11-23 03:19:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:03,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:19:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:19:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:19:03,810 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 387 [2022-11-23 03:19:03,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 54 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:03,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:03,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 387 [2022-11-23 03:19:03,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:04,666 INFO L130 PetriNetUnfolder]: 636/1065 cut-off events. [2022-11-23 03:19:04,666 INFO L131 PetriNetUnfolder]: For 6077/6077 co-relation queries the response was YES. [2022-11-23 03:19:04,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4863 conditions, 1065 events. 636/1065 cut-off events. For 6077/6077 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4716 event pairs, 237 based on Foata normal form. 30/1095 useless extension candidates. Maximal degree in co-relation 4826. Up to 907 conditions per place. [2022-11-23 03:19:04,672 INFO L137 encePairwiseOnDemand]: 378/387 looper letters, 49 selfloop transitions, 14 changer transitions 16/80 dead transitions. [2022-11-23 03:19:04,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 80 transitions, 893 flow [2022-11-23 03:19:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:19:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-23 03:19:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1189 transitions. [2022-11-23 03:19:04,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30723514211886305 [2022-11-23 03:19:04,677 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1189 transitions. [2022-11-23 03:19:04,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1189 transitions. [2022-11-23 03:19:04,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:04,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1189 transitions. [2022-11-23 03:19:04,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.9) internal successors, (1189), 10 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:04,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 387.0) internal successors, (4257), 11 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:04,685 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 387.0) internal successors, (4257), 11 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:04,685 INFO L175 Difference]: Start difference. First operand has 111 places, 54 transitions, 580 flow. Second operand 10 states and 1189 transitions. [2022-11-23 03:19:04,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 80 transitions, 893 flow [2022-11-23 03:19:04,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 80 transitions, 674 flow, removed 45 selfloop flow, removed 25 redundant places. [2022-11-23 03:19:04,694 INFO L231 Difference]: Finished difference. Result has 83 places, 55 transitions, 445 flow [2022-11-23 03:19:04,695 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=445, PETRI_PLACES=83, PETRI_TRANSITIONS=55} [2022-11-23 03:19:04,695 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -14 predicate places. [2022-11-23 03:19:04,695 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 55 transitions, 445 flow [2022-11-23 03:19:04,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:04,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:04,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 03:19:04,696 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1601606467, now seen corresponding path program 2 times [2022-11-23 03:19:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:04,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514548996] [2022-11-23 03:19:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:06,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514548996] [2022-11-23 03:19:06,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514548996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:06,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:06,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:19:06,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774068435] [2022-11-23 03:19:06,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:06,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:19:06,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:19:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:19:07,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 387 [2022-11-23 03:19:07,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 55 transitions, 445 flow. Second operand has 10 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:07,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:07,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 387 [2022-11-23 03:19:07,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:07,869 INFO L130 PetriNetUnfolder]: 653/1099 cut-off events. [2022-11-23 03:19:07,869 INFO L131 PetriNetUnfolder]: For 3687/3687 co-relation queries the response was YES. [2022-11-23 03:19:07,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 1099 events. 653/1099 cut-off events. For 3687/3687 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4938 event pairs, 182 based on Foata normal form. 30/1129 useless extension candidates. Maximal degree in co-relation 4299. Up to 855 conditions per place. [2022-11-23 03:19:07,876 INFO L137 encePairwiseOnDemand]: 379/387 looper letters, 48 selfloop transitions, 22 changer transitions 16/87 dead transitions. [2022-11-23 03:19:07,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 776 flow [2022-11-23 03:19:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:19:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 03:19:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1415 transitions. [2022-11-23 03:19:07,880 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3046942291128338 [2022-11-23 03:19:07,880 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1415 transitions. [2022-11-23 03:19:07,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1415 transitions. [2022-11-23 03:19:07,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:07,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1415 transitions. [2022-11-23 03:19:07,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.91666666666667) internal successors, (1415), 12 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:07,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 387.0) internal successors, (5031), 13 states have internal predecessors, (5031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:07,886 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 387.0) internal successors, (5031), 13 states have internal predecessors, (5031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:07,887 INFO L175 Difference]: Start difference. First operand has 83 places, 55 transitions, 445 flow. Second operand 12 states and 1415 transitions. [2022-11-23 03:19:07,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 776 flow [2022-11-23 03:19:07,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 715 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-23 03:19:07,896 INFO L231 Difference]: Finished difference. Result has 87 places, 55 transitions, 469 flow [2022-11-23 03:19:07,896 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=469, PETRI_PLACES=87, PETRI_TRANSITIONS=55} [2022-11-23 03:19:07,897 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -10 predicate places. [2022-11-23 03:19:07,897 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 55 transitions, 469 flow [2022-11-23 03:19:07,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:07,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:07,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:07,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 03:19:07,898 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -160336745, now seen corresponding path program 3 times [2022-11-23 03:19:07,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:07,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029240809] [2022-11-23 03:19:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:09,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029240809] [2022-11-23 03:19:09,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029240809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:09,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:09,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:19:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430337225] [2022-11-23 03:19:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:09,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:19:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:19:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:19:09,657 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 387 [2022-11-23 03:19:09,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 55 transitions, 469 flow. Second operand has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:09,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:09,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 387 [2022-11-23 03:19:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:10,389 INFO L130 PetriNetUnfolder]: 595/1007 cut-off events. [2022-11-23 03:19:10,389 INFO L131 PetriNetUnfolder]: For 3459/3459 co-relation queries the response was YES. [2022-11-23 03:19:10,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3881 conditions, 1007 events. 595/1007 cut-off events. For 3459/3459 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4408 event pairs, 68 based on Foata normal form. 36/1043 useless extension candidates. Maximal degree in co-relation 3857. Up to 625 conditions per place. [2022-11-23 03:19:10,395 INFO L137 encePairwiseOnDemand]: 379/387 looper letters, 42 selfloop transitions, 18 changer transitions 18/79 dead transitions. [2022-11-23 03:19:10,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 79 transitions, 707 flow [2022-11-23 03:19:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:19:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-23 03:19:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1318 transitions. [2022-11-23 03:19:10,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30960770495654216 [2022-11-23 03:19:10,399 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1318 transitions. [2022-11-23 03:19:10,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1318 transitions. [2022-11-23 03:19:10,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:10,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1318 transitions. [2022-11-23 03:19:10,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.81818181818181) internal successors, (1318), 11 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:10,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 387.0) internal successors, (4644), 12 states have internal predecessors, (4644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:10,407 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 387.0) internal successors, (4644), 12 states have internal predecessors, (4644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:10,407 INFO L175 Difference]: Start difference. First operand has 87 places, 55 transitions, 469 flow. Second operand 11 states and 1318 transitions. [2022-11-23 03:19:10,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 79 transitions, 707 flow [2022-11-23 03:19:10,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 79 transitions, 649 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-11-23 03:19:10,416 INFO L231 Difference]: Finished difference. Result has 88 places, 47 transitions, 383 flow [2022-11-23 03:19:10,416 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=88, PETRI_TRANSITIONS=47} [2022-11-23 03:19:10,417 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -9 predicate places. [2022-11-23 03:19:10,417 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 47 transitions, 383 flow [2022-11-23 03:19:10,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:10,417 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:10,417 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:10,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-23 03:19:10,417 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 983489235, now seen corresponding path program 1 times [2022-11-23 03:19:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:10,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891185977] [2022-11-23 03:19:10,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:13,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891185977] [2022-11-23 03:19:13,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891185977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:13,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:13,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:19:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658556013] [2022-11-23 03:19:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:13,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:19:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:19:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:19:13,373 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 387 [2022-11-23 03:19:13,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 47 transitions, 383 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:13,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:13,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 387 [2022-11-23 03:19:13,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:13,978 INFO L130 PetriNetUnfolder]: 735/1210 cut-off events. [2022-11-23 03:19:13,978 INFO L131 PetriNetUnfolder]: For 3688/3688 co-relation queries the response was YES. [2022-11-23 03:19:13,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4693 conditions, 1210 events. 735/1210 cut-off events. For 3688/3688 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5375 event pairs, 274 based on Foata normal form. 8/1218 useless extension candidates. Maximal degree in co-relation 4670. Up to 898 conditions per place. [2022-11-23 03:19:13,985 INFO L137 encePairwiseOnDemand]: 380/387 looper letters, 51 selfloop transitions, 23 changer transitions 0/75 dead transitions. [2022-11-23 03:19:13,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 694 flow [2022-11-23 03:19:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:19:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:19:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2022-11-23 03:19:13,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.34366925064599485 [2022-11-23 03:19:13,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 798 transitions. [2022-11-23 03:19:13,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 798 transitions. [2022-11-23 03:19:13,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:13,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 798 transitions. [2022-11-23 03:19:13,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:13,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:13,991 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 387.0) internal successors, (2709), 7 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:13,991 INFO L175 Difference]: Start difference. First operand has 88 places, 47 transitions, 383 flow. Second operand 6 states and 798 transitions. [2022-11-23 03:19:13,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 694 flow [2022-11-23 03:19:13,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 614 flow, removed 9 selfloop flow, removed 14 redundant places. [2022-11-23 03:19:13,997 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 459 flow [2022-11-23 03:19:13,998 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2022-11-23 03:19:13,998 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -19 predicate places. [2022-11-23 03:19:13,998 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 459 flow [2022-11-23 03:19:13,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:13,999 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:13,999 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:13,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 03:19:14,000 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1853726447, now seen corresponding path program 1 times [2022-11-23 03:19:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:14,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238840316] [2022-11-23 03:19:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:14,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238840316] [2022-11-23 03:19:14,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238840316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:14,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:14,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:19:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612142841] [2022-11-23 03:19:14,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:14,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:19:14,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:14,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:19:14,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:19:14,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 387 [2022-11-23 03:19:14,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:14,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 387 [2022-11-23 03:19:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:14,451 INFO L130 PetriNetUnfolder]: 427/798 cut-off events. [2022-11-23 03:19:14,451 INFO L131 PetriNetUnfolder]: For 2364/2382 co-relation queries the response was YES. [2022-11-23 03:19:14,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 798 events. 427/798 cut-off events. For 2364/2382 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3834 event pairs, 107 based on Foata normal form. 42/838 useless extension candidates. Maximal degree in co-relation 3017. Up to 641 conditions per place. [2022-11-23 03:19:14,456 INFO L137 encePairwiseOnDemand]: 382/387 looper letters, 56 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2022-11-23 03:19:14,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 696 flow [2022-11-23 03:19:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:19:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:19:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-11-23 03:19:14,458 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3643410852713178 [2022-11-23 03:19:14,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-11-23 03:19:14,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-11-23 03:19:14,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:14,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-11-23 03:19:14,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 387.0) internal successors, (1548), 4 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,461 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 459 flow. Second operand 3 states and 423 transitions. [2022-11-23 03:19:14,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 696 flow [2022-11-23 03:19:14,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 677 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-23 03:19:14,465 INFO L231 Difference]: Finished difference. Result has 78 places, 58 transitions, 456 flow [2022-11-23 03:19:14,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=78, PETRI_TRANSITIONS=58} [2022-11-23 03:19:14,466 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -19 predicate places. [2022-11-23 03:19:14,466 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 58 transitions, 456 flow [2022-11-23 03:19:14,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:14,466 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:14,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 03:19:14,467 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1324315752, now seen corresponding path program 1 times [2022-11-23 03:19:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55183163] [2022-11-23 03:19:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55183163] [2022-11-23 03:19:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55183163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:14,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:14,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:19:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695936361] [2022-11-23 03:19:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:19:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:19:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:19:14,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 387 [2022-11-23 03:19:14,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 58 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:14,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 387 [2022-11-23 03:19:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:14,990 INFO L130 PetriNetUnfolder]: 203/442 cut-off events. [2022-11-23 03:19:14,990 INFO L131 PetriNetUnfolder]: For 1361/1367 co-relation queries the response was YES. [2022-11-23 03:19:14,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 442 events. 203/442 cut-off events. For 1361/1367 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2025 event pairs, 14 based on Foata normal form. 48/488 useless extension candidates. Maximal degree in co-relation 1944. Up to 174 conditions per place. [2022-11-23 03:19:14,993 INFO L137 encePairwiseOnDemand]: 382/387 looper letters, 58 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2022-11-23 03:19:14,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 77 transitions, 702 flow [2022-11-23 03:19:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:19:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:19:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-11-23 03:19:14,995 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36304909560723514 [2022-11-23 03:19:14,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-11-23 03:19:14,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-11-23 03:19:14,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:14,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-11-23 03:19:14,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:14,999 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 387.0) internal successors, (1935), 5 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:15,000 INFO L175 Difference]: Start difference. First operand has 78 places, 58 transitions, 456 flow. Second operand 4 states and 562 transitions. [2022-11-23 03:19:15,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 77 transitions, 702 flow [2022-11-23 03:19:15,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 77 transitions, 678 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-23 03:19:15,005 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 416 flow [2022-11-23 03:19:15,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2022-11-23 03:19:15,006 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -20 predicate places. [2022-11-23 03:19:15,006 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 416 flow [2022-11-23 03:19:15,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:15,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:15,007 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:15,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 03:19:15,008 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1690590804, now seen corresponding path program 1 times [2022-11-23 03:19:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:15,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531124369] [2022-11-23 03:19:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:17,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531124369] [2022-11-23 03:19:17,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531124369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:17,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:17,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:19:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402188454] [2022-11-23 03:19:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:17,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:19:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:19:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:19:17,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 387 [2022-11-23 03:19:17,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 54 transitions, 416 flow. Second operand has 10 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:17,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:17,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 387 [2022-11-23 03:19:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:18,310 INFO L130 PetriNetUnfolder]: 250/506 cut-off events. [2022-11-23 03:19:18,310 INFO L131 PetriNetUnfolder]: For 1593/1593 co-relation queries the response was YES. [2022-11-23 03:19:18,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 506 events. 250/506 cut-off events. For 1593/1593 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2127 event pairs, 29 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 2443. Up to 193 conditions per place. [2022-11-23 03:19:18,313 INFO L137 encePairwiseOnDemand]: 379/387 looper letters, 79 selfloop transitions, 33 changer transitions 0/113 dead transitions. [2022-11-23 03:19:18,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 113 transitions, 1063 flow [2022-11-23 03:19:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:19:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:19:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1114 transitions. [2022-11-23 03:19:18,316 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3198392190640253 [2022-11-23 03:19:18,316 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1114 transitions. [2022-11-23 03:19:18,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1114 transitions. [2022-11-23 03:19:18,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:18,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1114 transitions. [2022-11-23 03:19:18,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:18,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 387.0) internal successors, (3870), 10 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:18,320 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 387.0) internal successors, (3870), 10 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:18,320 INFO L175 Difference]: Start difference. First operand has 77 places, 54 transitions, 416 flow. Second operand 9 states and 1114 transitions. [2022-11-23 03:19:18,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 113 transitions, 1063 flow [2022-11-23 03:19:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 1019 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-11-23 03:19:18,325 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 652 flow [2022-11-23 03:19:18,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=652, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2022-11-23 03:19:18,326 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -10 predicate places. [2022-11-23 03:19:18,326 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 652 flow [2022-11-23 03:19:18,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:18,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:18,326 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:18,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-23 03:19:18,326 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 138125050, now seen corresponding path program 2 times [2022-11-23 03:19:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:18,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206695255] [2022-11-23 03:19:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:20,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:20,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206695255] [2022-11-23 03:19:20,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206695255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:20,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:20,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:19:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428480735] [2022-11-23 03:19:20,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:20,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:19:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:19:20,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:19:20,351 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 387 [2022-11-23 03:19:20,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 652 flow. Second operand has 7 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:20,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:20,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 387 [2022-11-23 03:19:20,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:20,688 INFO L130 PetriNetUnfolder]: 249/502 cut-off events. [2022-11-23 03:19:20,689 INFO L131 PetriNetUnfolder]: For 1872/1872 co-relation queries the response was YES. [2022-11-23 03:19:20,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 502 events. 249/502 cut-off events. For 1872/1872 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2106 event pairs, 90 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 2557. Up to 397 conditions per place. [2022-11-23 03:19:20,692 INFO L137 encePairwiseOnDemand]: 382/387 looper letters, 54 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2022-11-23 03:19:20,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 77 transitions, 844 flow [2022-11-23 03:19:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:19:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:19:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2022-11-23 03:19:20,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3426356589147287 [2022-11-23 03:19:20,695 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2022-11-23 03:19:20,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2022-11-23 03:19:20,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:20,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2022-11-23 03:19:20,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:20,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:20,697 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:20,697 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 652 flow. Second operand 5 states and 663 transitions. [2022-11-23 03:19:20,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 77 transitions, 844 flow [2022-11-23 03:19:20,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 811 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-23 03:19:20,703 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 681 flow [2022-11-23 03:19:20,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=681, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2022-11-23 03:19:20,704 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -9 predicate places. [2022-11-23 03:19:20,705 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 681 flow [2022-11-23 03:19:20,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:20,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:20,705 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:20,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-23 03:19:20,706 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 243817473, now seen corresponding path program 1 times [2022-11-23 03:19:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:20,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895724987] [2022-11-23 03:19:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:20,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:19:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:19:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:19:21,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895724987] [2022-11-23 03:19:21,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895724987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:19:21,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:19:21,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:19:21,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418343866] [2022-11-23 03:19:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:19:21,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:19:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:19:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:19:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:19:21,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 387 [2022-11-23 03:19:21,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 681 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:21,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:19:21,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 387 [2022-11-23 03:19:21,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:19:21,330 INFO L130 PetriNetUnfolder]: 157/339 cut-off events. [2022-11-23 03:19:21,330 INFO L131 PetriNetUnfolder]: For 1827/1834 co-relation queries the response was YES. [2022-11-23 03:19:21,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 339 events. 157/339 cut-off events. For 1827/1834 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1542 event pairs, 8 based on Foata normal form. 27/362 useless extension candidates. Maximal degree in co-relation 1664. Up to 155 conditions per place. [2022-11-23 03:19:21,332 INFO L137 encePairwiseOnDemand]: 382/387 looper letters, 68 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2022-11-23 03:19:21,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 1046 flow [2022-11-23 03:19:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:19:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:19:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-11-23 03:19:21,334 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35762273901808783 [2022-11-23 03:19:21,335 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2022-11-23 03:19:21,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2022-11-23 03:19:21,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:19:21,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2022-11-23 03:19:21,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:21,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:21,337 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 387.0) internal successors, (2322), 6 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:21,337 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 681 flow. Second operand 5 states and 692 transitions. [2022-11-23 03:19:21,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 1046 flow [2022-11-23 03:19:21,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 94 transitions, 958 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-11-23 03:19:21,342 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 571 flow [2022-11-23 03:19:21,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=387, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2022-11-23 03:19:21,343 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -11 predicate places. [2022-11-23 03:19:21,343 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 571 flow [2022-11-23 03:19:21,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:19:21,344 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:19:21,344 INFO L209 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] [2022-11-23 03:19:21,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-23 03:19:21,344 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:19:21,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:19:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1802201540, now seen corresponding path program 1 times [2022-11-23 03:19:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:19:21,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132229034] [2022-11-23 03:19:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:19:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:19:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:19:21,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:19:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:19:21,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:19:21,641 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:19:21,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2022-11-23 03:19:21,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2022-11-23 03:19:21,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2022-11-23 03:19:21,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2022-11-23 03:19:21,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2022-11-23 03:19:21,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2022-11-23 03:19:21,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2022-11-23 03:19:21,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2022-11-23 03:19:21,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2022-11-23 03:19:21,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2022-11-23 03:19:21,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2022-11-23 03:19:21,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2022-11-23 03:19:21,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2022-11-23 03:19:21,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2022-11-23 03:19:21,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2022-11-23 03:19:21,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2022-11-23 03:19:21,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2022-11-23 03:19:21,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2022-11-23 03:19:21,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2022-11-23 03:19:21,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2022-11-23 03:19:21,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2022-11-23 03:19:21,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2022-11-23 03:19:21,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2022-11-23 03:19:21,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2022-11-23 03:19:21,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2022-11-23 03:19:21,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2022-11-23 03:19:21,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2022-11-23 03:19:21,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2022-11-23 03:19:21,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2022-11-23 03:19:21,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2022-11-23 03:19:21,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2022-11-23 03:19:21,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2022-11-23 03:19:21,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2022-11-23 03:19:21,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2022-11-23 03:19:21,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2022-11-23 03:19:21,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2022-11-23 03:19:21,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2022-11-23 03:19:21,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2022-11-23 03:19:21,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2022-11-23 03:19:21,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2022-11-23 03:19:21,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2022-11-23 03:19:21,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2022-11-23 03:19:21,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2022-11-23 03:19:21,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2022-11-23 03:19:21,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2022-11-23 03:19:21,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2022-11-23 03:19:21,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2022-11-23 03:19:21,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2022-11-23 03:19:21,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2022-11-23 03:19:21,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2022-11-23 03:19:21,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2022-11-23 03:19:21,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2022-11-23 03:19:21,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2022-11-23 03:19:21,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2022-11-23 03:19:21,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2022-11-23 03:19:21,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2022-11-23 03:19:21,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2022-11-23 03:19:21,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2022-11-23 03:19:21,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2022-11-23 03:19:21,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2022-11-23 03:19:21,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2022-11-23 03:19:21,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2022-11-23 03:19:21,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2022-11-23 03:19:21,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2022-11-23 03:19:21,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2022-11-23 03:19:21,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2022-11-23 03:19:21,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2022-11-23 03:19:21,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2022-11-23 03:19:21,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2022-11-23 03:19:21,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2022-11-23 03:19:21,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2022-11-23 03:19:21,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2022-11-23 03:19:21,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2022-11-23 03:19:21,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2022-11-23 03:19:21,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2022-11-23 03:19:21,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2022-11-23 03:19:21,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2022-11-23 03:19:21,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2022-11-23 03:19:21,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2022-11-23 03:19:21,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2022-11-23 03:19:21,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2022-11-23 03:19:21,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2022-11-23 03:19:21,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2022-11-23 03:19:21,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2022-11-23 03:19:21,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2022-11-23 03:19:21,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2022-11-23 03:19:21,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2022-11-23 03:19:21,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2022-11-23 03:19:21,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2022-11-23 03:19:21,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2022-11-23 03:19:21,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2022-11-23 03:19:21,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2022-11-23 03:19:21,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2022-11-23 03:19:21,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2022-11-23 03:19:21,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2022-11-23 03:19:21,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2022-11-23 03:19:21,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2022-11-23 03:19:21,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2022-11-23 03:19:21,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2022-11-23 03:19:21,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2022-11-23 03:19:21,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2022-11-23 03:19:21,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-23 03:19:21,676 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:19:21,685 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:19:21,686 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:19:21,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:19:21 BasicIcfg [2022-11-23 03:19:21,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:19:21,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:19:21,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:19:21,877 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:19:21,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:55" (3/4) ... [2022-11-23 03:19:21,881 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:19:21,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:19:21,882 INFO L158 Benchmark]: Toolchain (without parser) took 150276.06ms. Allocated memory was 157.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 110.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 376.4MB. Max. memory is 16.1GB. [2022-11-23 03:19:21,882 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 157.3MB. Free memory was 103.7MB in the beginning and 103.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:19:21,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 887.34ms. Allocated memory is still 157.3MB. Free memory was 110.1MB in the beginning and 84.1MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-23 03:19:21,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.72ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 81.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:19:21,884 INFO L158 Benchmark]: Boogie Preprocessor took 103.50ms. Allocated memory is still 157.3MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:19:21,884 INFO L158 Benchmark]: RCFGBuilder took 2309.95ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 79.3MB in the beginning and 100.7MB in the end (delta: -21.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2022-11-23 03:19:21,885 INFO L158 Benchmark]: TraceAbstraction took 146846.27ms. Allocated memory was 213.9MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 99.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 306.5MB. Max. memory is 16.1GB. [2022-11-23 03:19:21,885 INFO L158 Benchmark]: Witness Printer took 5.07ms. Allocated memory is still 2.8GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:19:21,887 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 157.3MB. Free memory was 103.7MB in the beginning and 103.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 887.34ms. Allocated memory is still 157.3MB. Free memory was 110.1MB in the beginning and 84.1MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.72ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 81.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.50ms. Allocated memory is still 157.3MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2309.95ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 79.3MB in the beginning and 100.7MB in the end (delta: -21.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * TraceAbstraction took 146846.27ms. Allocated memory was 213.9MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 99.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 306.5MB. Max. memory is 16.1GB. * Witness Printer took 5.07ms. Allocated memory is still 2.8GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.1s, 201 PlacesBefore, 97 PlacesAfterwards, 193 TransitionsBefore, 88 TransitionsAfterwards, 8948 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 114 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 191 TotalNumberOfCompositions, 35722 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15165, independent: 14688, independent conditional: 0, independent unconditional: 14688, dependent: 452, dependent conditional: 0, dependent unconditional: 452, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5884, independent: 5780, independent conditional: 0, independent unconditional: 5780, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5884, independent: 4742, independent conditional: 0, independent unconditional: 4742, dependent: 1142, dependent conditional: 0, dependent unconditional: 1142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1142, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6787, independent: 5468, independent conditional: 0, independent unconditional: 5468, dependent: 1121, dependent conditional: 0, dependent unconditional: 1121, unknown: 198, unknown conditional: 0, unknown unconditional: 198] ], Cache Queries: [ total: 15165, independent: 8908, independent conditional: 0, independent unconditional: 8908, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 5905, unknown conditional: 0, unknown unconditional: 5905] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 941, Positive conditional cache size: 0, Positive unconditional cache size: 941, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=1, t1789={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t1790; VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1789={7:0}, t1790={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=2, t1789={7:0}, t1790={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t1791; VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=3, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={7:0}, t1790={5:0}, t1791={6:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 257 locations, 101 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: 146.4s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 66.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 51.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4141 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 1956 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1547 mSDsCounter, 820 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8654 IncrementalHoareTripleChecker+Invalid, 9474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 820 mSolverCounterUnsat, 409 mSDtfsCounter, 8654 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3222occurred in iteration=19, InterpolantAutomatonStates: 164, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 5849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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 [2022-11-23 03:19:21,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:19:25,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:19:25,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:19:25,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:19:25,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:19:25,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:19:25,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:19:25,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:19:25,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:19:25,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:19:25,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:19:25,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:19:25,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:19:25,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:19:25,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:19:25,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:19:25,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:19:25,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:19:25,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:19:25,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:19:25,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:19:25,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:19:25,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:19:25,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:19:25,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:19:25,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:19:25,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:19:25,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:19:25,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:19:25,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:19:25,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:19:25,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:19:25,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:19:25,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:19:25,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:19:25,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:19:25,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:19:25,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:19:25,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:19:25,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:19:25,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:19:25,184 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 03:19:25,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:19:25,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:19:25,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:19:25,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:19:25,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:19:25,219 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:19:25,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:19:25,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:19:25,220 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:19:25,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:19:25,221 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:19:25,221 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:19:25,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:19:25,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:19:25,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:19:25,223 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:19:25,223 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:19:25,223 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:19:25,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:19:25,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:19:25,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 03:19:25,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 03:19:25,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:19:25,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:19:25,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:19:25,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:19:25,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:19:25,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:19:25,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:19:25,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:19:25,227 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 03:19:25,227 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 03:19:25,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:19:25,228 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:19:25,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:19:25,229 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 03:19:25,229 INFO L138 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_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 [2022-11-23 03:19:25,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:19:25,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:19:25,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:19:25,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:19:25,720 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:19:25,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2022-11-23 03:19:29,531 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:19:29,969 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:19:29,970 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2022-11-23 03:19:29,986 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data/5391ea8ec/ee51a95cfd2d4825970a148565355c0c/FLAG10bd7af0c [2022-11-23 03:19:30,014 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/data/5391ea8ec/ee51a95cfd2d4825970a148565355c0c [2022-11-23 03:19:30,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:19:30,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:19:30,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:19:30,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:19:30,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:19:30,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:30,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e216ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30, skipping insertion in model container [2022-11-23 03:19:30,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:30,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:19:30,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:19:30,450 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/sv-benchmarks/c/pthread-wmm/safe000_rmo.i[988,1001] [2022-11-23 03:19:30,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:19:30,767 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:19:30,783 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/sv-benchmarks/c/pthread-wmm/safe000_rmo.i[988,1001] [2022-11-23 03:19:30,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:19:30,951 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:19:30,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30 WrapperNode [2022-11-23 03:19:30,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:19:30,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:19:30,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:19:30,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:19:30,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,094 INFO L138 Inliner]: procedures = 180, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2022-11-23 03:19:31,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:19:31,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:19:31,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:19:31,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:19:31,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:19:31,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:19:31,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:19:31,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:19:31,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (1/1) ... [2022-11-23 03:19:31,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:19:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:19:31,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:19:31,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:19:31,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 03:19:31,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:19:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:19:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:19:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:19:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 03:19:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 03:19:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-23 03:19:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:19:31,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:19:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:19:31,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:19:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:19:31,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:19:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:19:31,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:19:31,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:19:31,330 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:19:31,625 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:19:31,628 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:19:32,856 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:19:33,972 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:19:33,972 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:19:33,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:33 BoogieIcfgContainer [2022-11-23 03:19:33,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:19:33,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:19:33,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:19:33,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:19:33,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:19:30" (1/3) ... [2022-11-23 03:19:33,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67225ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:19:33, skipping insertion in model container [2022-11-23 03:19:33,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:19:30" (2/3) ... [2022-11-23 03:19:33,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67225ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:19:33, skipping insertion in model container [2022-11-23 03:19:33,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:33" (3/3) ... [2022-11-23 03:19:33,989 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2022-11-23 03:19:34,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:19:34,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-23 03:19:34,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:19:34,251 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:19:34,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 197 transitions, 409 flow [2022-11-23 03:19:34,532 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-11-23 03:19:34,532 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:19:34,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-23 03:19:34,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 197 transitions, 409 flow [2022-11-23 03:19:34,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 194 transitions, 397 flow [2022-11-23 03:19:34,574 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:19:34,607 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 194 transitions, 397 flow [2022-11-23 03:19:34,616 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 194 transitions, 397 flow [2022-11-23 03:19:34,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 194 transitions, 397 flow [2022-11-23 03:19:34,752 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-11-23 03:19:34,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:19:34,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-11-23 03:19:34,765 INFO L119 LiptonReduction]: Number of co-enabled transitions 8948 [2022-11-23 03:19:43,860 WARN L233 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 191 DAG size of output: 189 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 03:19:57,086 WARN L233 SmtUtils]: Spent 9.58s on a formula simplification. DAG size of input: 219 DAG size of output: 217 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 03:21:15,822 INFO L134 LiptonReduction]: Checked pairs total: 38821 [2022-11-23 03:21:15,822 INFO L136 LiptonReduction]: Total number of compositions: 194 [2022-11-23 03:21:15,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:21:15,847 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;@1ee49a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:21:15,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2022-11-23 03:21:15,849 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 03:21:15,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:21:15,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:15,850 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 03:21:15,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1235, now seen corresponding path program 1 times [2022-11-23 03:21:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:15,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182658791] [2022-11-23 03:21:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:15,871 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 [2022-11-23 03:21:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:15,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:15,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:16,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 03:21:16,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:16,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:16,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182658791] [2022-11-23 03:21:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182658791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:16,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:16,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 03:21:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423121848] [2022-11-23 03:21:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:16,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:21:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:16,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:21:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:21:16,207 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 391 [2022-11-23 03:21:16,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 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) [2022-11-23 03:21:16,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:16,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 391 [2022-11-23 03:21:16,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:22,334 INFO L130 PetriNetUnfolder]: 13766/19839 cut-off events. [2022-11-23 03:21:22,335 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 03:21:22,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39278 conditions, 19839 events. 13766/19839 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 137533 event pairs, 13766 based on Foata normal form. 0/8613 useless extension candidates. Maximal degree in co-relation 39267. Up to 19343 conditions per place. [2022-11-23 03:21:22,518 INFO L137 encePairwiseOnDemand]: 351/391 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-11-23 03:21:22,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 189 flow [2022-11-23 03:21:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:21:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 03:21:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-11-23 03:21:22,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45012787723785164 [2022-11-23 03:21:22,547 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 352 transitions. [2022-11-23 03:21:22,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 352 transitions. [2022-11-23 03:21:22,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:22,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 352 transitions. [2022-11-23 03:21:22,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 176.0) internal successors, (352), 2 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:22,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:22,576 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:22,578 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 352 transitions. [2022-11-23 03:21:22,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 189 flow [2022-11-23 03:21:22,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:21:22,595 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 102 flow [2022-11-23 03:21:22,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-11-23 03:21:22,603 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2022-11-23 03:21:22,604 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 102 flow [2022-11-23 03:21:22,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 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) [2022-11-23 03:21:22,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:22,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:21:22,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-23 03:21:22,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:22,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1221255, now seen corresponding path program 1 times [2022-11-23 03:21:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979555163] [2022-11-23 03:21:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:22,825 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 [2022-11-23 03:21:22,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:22,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:22,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:23,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:21:23,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:23,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:21:23,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 03:21:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:23,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:23,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:23,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979555163] [2022-11-23 03:21:23,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979555163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:23,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:23,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:21:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005688990] [2022-11-23 03:21:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:23,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:23,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:23,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 391 [2022-11-23 03:21:23,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:23,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:23,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 391 [2022-11-23 03:21:23,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:26,243 INFO L130 PetriNetUnfolder]: 5696/8335 cut-off events. [2022-11-23 03:21:26,244 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:21:26,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16529 conditions, 8335 events. 5696/8335 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 51918 event pairs, 5696 based on Foata normal form. 404/5009 useless extension candidates. Maximal degree in co-relation 16526. Up to 8133 conditions per place. [2022-11-23 03:21:26,312 INFO L137 encePairwiseOnDemand]: 382/391 looper letters, 34 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-11-23 03:21:26,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 156 flow [2022-11-23 03:21:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:21:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-23 03:21:26,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-11-23 03:21:26,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-23 03:21:26,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-23 03:21:26,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:26,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-23 03:21:26,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:26,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:26,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:26,331 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 102 flow. Second operand 3 states and 442 transitions. [2022-11-23 03:21:26,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 156 flow [2022-11-23 03:21:26,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:21:26,334 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2022-11-23 03:21:26,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-23 03:21:26,336 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2022-11-23 03:21:26,336 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2022-11-23 03:21:26,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:26,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:26,337 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:21:26,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:26,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:26,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1221254, now seen corresponding path program 1 times [2022-11-23 03:21:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:26,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114691981] [2022-11-23 03:21:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:26,555 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 [2022-11-23 03:21:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:26,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:26,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:26,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:21:26,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:26,952 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:21:26,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:21:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:26,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:26,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:26,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114691981] [2022-11-23 03:21:26,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114691981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:26,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:26,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:21:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921918039] [2022-11-23 03:21:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:26,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:26,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:26,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:27,137 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 391 [2022-11-23 03:21:27,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:27,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:27,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 391 [2022-11-23 03:21:27,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:28,415 INFO L130 PetriNetUnfolder]: 2786/4093 cut-off events. [2022-11-23 03:21:28,415 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:21:28,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8194 conditions, 4093 events. 2786/4093 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 22587 event pairs, 1618 based on Foata normal form. 177/3070 useless extension candidates. Maximal degree in co-relation 8190. Up to 2945 conditions per place. [2022-11-23 03:21:28,448 INFO L137 encePairwiseOnDemand]: 378/391 looper letters, 40 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-23 03:21:28,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 182 flow [2022-11-23 03:21:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:21:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-11-23 03:21:28,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3776641091219096 [2022-11-23 03:21:28,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2022-11-23 03:21:28,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2022-11-23 03:21:28,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:28,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2022-11-23 03:21:28,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:28,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:28,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:28,460 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 443 transitions. [2022-11-23 03:21:28,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 182 flow [2022-11-23 03:21:28,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:21:28,463 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 103 flow [2022-11-23 03:21:28,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-11-23 03:21:28,465 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -48 predicate places. [2022-11-23 03:21:28,466 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 103 flow [2022-11-23 03:21:28,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:28,473 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:28,473 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:28,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:28,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:28,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1612367112, now seen corresponding path program 1 times [2022-11-23 03:21:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:28,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365031838] [2022-11-23 03:21:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:28,688 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 [2022-11-23 03:21:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:28,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:28,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:29,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:21:29,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:29,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:29,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:29,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365031838] [2022-11-23 03:21:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365031838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:21:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761666] [2022-11-23 03:21:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:29,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:21:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:21:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:21:29,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 391 [2022-11-23 03:21:29,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:29,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:29,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 391 [2022-11-23 03:21:29,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:29,785 INFO L130 PetriNetUnfolder]: 950/1587 cut-off events. [2022-11-23 03:21:29,786 INFO L131 PetriNetUnfolder]: For 127/161 co-relation queries the response was YES. [2022-11-23 03:21:29,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1587 events. 950/1587 cut-off events. For 127/161 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8842 event pairs, 377 based on Foata normal form. 18/1334 useless extension candidates. Maximal degree in co-relation 3522. Up to 1464 conditions per place. [2022-11-23 03:21:29,799 INFO L137 encePairwiseOnDemand]: 386/391 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-11-23 03:21:29,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 227 flow [2022-11-23 03:21:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:21:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:21:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-11-23 03:21:29,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3751065643648764 [2022-11-23 03:21:29,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2022-11-23 03:21:29,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2022-11-23 03:21:29,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:29,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2022-11-23 03:21:29,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:29,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:29,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:29,812 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 103 flow. Second operand 3 states and 440 transitions. [2022-11-23 03:21:29,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 227 flow [2022-11-23 03:21:29,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:21:29,816 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 125 flow [2022-11-23 03:21:29,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-23 03:21:29,817 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2022-11-23 03:21:29,818 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 125 flow [2022-11-23 03:21:29,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:29,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:29,819 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:29,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:30,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:30,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash 260070915, now seen corresponding path program 1 times [2022-11-23 03:21:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475978285] [2022-11-23 03:21:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:30,038 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 [2022-11-23 03:21:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:30,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:30,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 03:21:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:30,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:21:30,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:30,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:30,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:30,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475978285] [2022-11-23 03:21:30,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475978285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:30,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:30,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117874126] [2022-11-23 03:21:30,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:30,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:21:30,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:30,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:21:30,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:21:30,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 391 [2022-11-23 03:21:30,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:30,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:30,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 391 [2022-11-23 03:21:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:31,084 INFO L130 PetriNetUnfolder]: 212/432 cut-off events. [2022-11-23 03:21:31,084 INFO L131 PetriNetUnfolder]: For 70/74 co-relation queries the response was YES. [2022-11-23 03:21:31,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 432 events. 212/432 cut-off events. For 70/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1845 event pairs, 68 based on Foata normal form. 21/400 useless extension candidates. Maximal degree in co-relation 1063. Up to 246 conditions per place. [2022-11-23 03:21:31,088 INFO L137 encePairwiseOnDemand]: 386/391 looper letters, 50 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-11-23 03:21:31,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 295 flow [2022-11-23 03:21:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:21:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2022-11-23 03:21:31,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3721227621483376 [2022-11-23 03:21:31,097 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2022-11-23 03:21:31,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2022-11-23 03:21:31,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:31,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2022-11-23 03:21:31,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 391.0) internal successors, (1955), 5 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 391.0) internal successors, (1955), 5 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,107 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 125 flow. Second operand 4 states and 582 transitions. [2022-11-23 03:21:31,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 295 flow [2022-11-23 03:21:31,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:21:31,112 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 161 flow [2022-11-23 03:21:31,113 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-11-23 03:21:31,117 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -44 predicate places. [2022-11-23 03:21:31,118 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 161 flow [2022-11-23 03:21:31,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:31,119 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:31,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:31,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:31,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 67657198, now seen corresponding path program 1 times [2022-11-23 03:21:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:31,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477555561] [2022-11-23 03:21:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:31,336 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 [2022-11-23 03:21:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:31,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:31,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 03:21:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:31,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:21:31,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:31,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:31,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:31,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477555561] [2022-11-23 03:21:31,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477555561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:31,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:31,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373490872] [2022-11-23 03:21:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:31,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:21:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:21:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:31,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 391 [2022-11-23 03:21:31,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:31,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:31,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 391 [2022-11-23 03:21:31,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:32,456 INFO L130 PetriNetUnfolder]: 114/228 cut-off events. [2022-11-23 03:21:32,457 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-11-23 03:21:32,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 228 events. 114/228 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 774 event pairs, 40 based on Foata normal form. 8/229 useless extension candidates. Maximal degree in co-relation 634. Up to 92 conditions per place. [2022-11-23 03:21:32,458 INFO L137 encePairwiseOnDemand]: 386/391 looper letters, 40 selfloop transitions, 10 changer transitions 1/54 dead transitions. [2022-11-23 03:21:32,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 275 flow [2022-11-23 03:21:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:21:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:21:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2022-11-23 03:21:32,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36163682864450125 [2022-11-23 03:21:32,463 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2022-11-23 03:21:32,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2022-11-23 03:21:32,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:32,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2022-11-23 03:21:32,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:32,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 391.0) internal successors, (2346), 6 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:32,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 391.0) internal successors, (2346), 6 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:32,473 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 161 flow. Second operand 5 states and 707 transitions. [2022-11-23 03:21:32,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 275 flow [2022-11-23 03:21:32,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 259 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-23 03:21:32,476 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2022-11-23 03:21:32,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-11-23 03:21:32,478 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -50 predicate places. [2022-11-23 03:21:32,478 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2022-11-23 03:21:32,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:32,479 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:32,479 INFO L209 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] [2022-11-23 03:21:32,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:32,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 7823353, now seen corresponding path program 1 times [2022-11-23 03:21:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:32,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066183389] [2022-11-23 03:21:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:32,697 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 [2022-11-23 03:21:32,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:32,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:32,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (8)] Waiting until timeout for monitored process [2022-11-23 03:21:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:33,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:21:33,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:33,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:33,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:33,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066183389] [2022-11-23 03:21:33,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066183389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:33,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:33,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:33,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014331255] [2022-11-23 03:21:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:33,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:21:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:21:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:33,314 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 391 [2022-11-23 03:21:33,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:33,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:33,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 391 [2022-11-23 03:21:33,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:34,056 INFO L130 PetriNetUnfolder]: 237/454 cut-off events. [2022-11-23 03:21:34,056 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2022-11-23 03:21:34,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 454 events. 237/454 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2031 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 1305. Up to 168 conditions per place. [2022-11-23 03:21:34,059 INFO L137 encePairwiseOnDemand]: 386/391 looper letters, 89 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2022-11-23 03:21:34,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 96 transitions, 589 flow [2022-11-23 03:21:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:21:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:21:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2022-11-23 03:21:34,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3653026427962489 [2022-11-23 03:21:34,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2022-11-23 03:21:34,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2022-11-23 03:21:34,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:34,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2022-11-23 03:21:34,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:34,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:34,073 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:34,073 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 6 states and 857 transitions. [2022-11-23 03:21:34,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 96 transitions, 589 flow [2022-11-23 03:21:34,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 521 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-23 03:21:34,080 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 135 flow [2022-11-23 03:21:34,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2022-11-23 03:21:34,081 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2022-11-23 03:21:34,081 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 135 flow [2022-11-23 03:21:34,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:34,082 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:34,082 INFO L209 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] [2022-11-23 03:21:34,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:34,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:34,298 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 528441601, now seen corresponding path program 2 times [2022-11-23 03:21:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:34,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106472910] [2022-11-23 03:21:34,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:21:34,300 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 [2022-11-23 03:21:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:34,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:34,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (9)] Waiting until timeout for monitored process [2022-11-23 03:21:34,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 03:21:34,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:34,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:21:34,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:34,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:34,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:34,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106472910] [2022-11-23 03:21:34,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106472910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:34,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:34,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50049410] [2022-11-23 03:21:34,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:34,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:21:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:21:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:34,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 391 [2022-11-23 03:21:34,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:34,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:34,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 391 [2022-11-23 03:21:34,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:35,417 INFO L130 PetriNetUnfolder]: 280/561 cut-off events. [2022-11-23 03:21:35,418 INFO L131 PetriNetUnfolder]: For 432/432 co-relation queries the response was YES. [2022-11-23 03:21:35,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 561 events. 280/561 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2824 event pairs, 17 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 1655. Up to 266 conditions per place. [2022-11-23 03:21:35,421 INFO L137 encePairwiseOnDemand]: 386/391 looper letters, 79 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2022-11-23 03:21:35,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 483 flow [2022-11-23 03:21:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:21:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:21:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2022-11-23 03:21:35,424 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36726342710997445 [2022-11-23 03:21:35,425 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2022-11-23 03:21:35,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2022-11-23 03:21:35,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:35,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2022-11-23 03:21:35,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:35,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 391.0) internal successors, (2346), 6 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:35,433 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 391.0) internal successors, (2346), 6 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:35,433 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 135 flow. Second operand 5 states and 718 transitions. [2022-11-23 03:21:35,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 483 flow [2022-11-23 03:21:35,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:21:35,438 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 149 flow [2022-11-23 03:21:35,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2022-11-23 03:21:35,440 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -45 predicate places. [2022-11-23 03:21:35,440 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 149 flow [2022-11-23 03:21:35,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:35,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:35,441 INFO L209 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] [2022-11-23 03:21:35,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:35,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:35,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2140971893, now seen corresponding path program 1 times [2022-11-23 03:21:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:35,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290311165] [2022-11-23 03:21:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:21:35,660 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 [2022-11-23 03:21:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:35,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:35,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (10)] Waiting until timeout for monitored process [2022-11-23 03:21:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:21:36,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:21:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:36,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:36,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:36,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290311165] [2022-11-23 03:21:36,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290311165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:36,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:36,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:21:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75497274] [2022-11-23 03:21:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:21:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:21:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:21:36,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 391 [2022-11-23 03:21:36,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:36,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:36,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 391 [2022-11-23 03:21:36,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:36,826 INFO L130 PetriNetUnfolder]: 320/647 cut-off events. [2022-11-23 03:21:36,826 INFO L131 PetriNetUnfolder]: For 634/634 co-relation queries the response was YES. [2022-11-23 03:21:36,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 647 events. 320/647 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3211 event pairs, 67 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 1930. Up to 525 conditions per place. [2022-11-23 03:21:36,831 INFO L137 encePairwiseOnDemand]: 387/391 looper letters, 46 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-11-23 03:21:36,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 291 flow [2022-11-23 03:21:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:21:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:21:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2022-11-23 03:21:36,835 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3561381074168798 [2022-11-23 03:21:36,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2022-11-23 03:21:36,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2022-11-23 03:21:36,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:36,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2022-11-23 03:21:36,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:36,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 391.0) internal successors, (1955), 5 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:36,842 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 391.0) internal successors, (1955), 5 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:36,843 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 149 flow. Second operand 4 states and 557 transitions. [2022-11-23 03:21:36,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 291 flow [2022-11-23 03:21:36,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 279 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 03:21:36,850 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 137 flow [2022-11-23 03:21:36,850 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-11-23 03:21:36,851 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -48 predicate places. [2022-11-23 03:21:36,852 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 137 flow [2022-11-23 03:21:36,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:36,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:36,852 INFO L209 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] [2022-11-23 03:21:36,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:37,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:37,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 822403583, now seen corresponding path program 3 times [2022-11-23 03:21:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254828425] [2022-11-23 03:21:37,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:21:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:21:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:37,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:37,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (11)] Waiting until timeout for monitored process [2022-11-23 03:21:37,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 03:21:37,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:37,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 03:21:37,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:37,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:21:37,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 03:21:38,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 03:21:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:38,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:38,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:38,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254828425] [2022-11-23 03:21:38,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254828425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:38,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:38,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:21:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485900570] [2022-11-23 03:21:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:38,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:21:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:21:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:21:39,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 391 [2022-11-23 03:21:39,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:39,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:39,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 391 [2022-11-23 03:21:39,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:40,158 INFO L130 PetriNetUnfolder]: 442/907 cut-off events. [2022-11-23 03:21:40,159 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2022-11-23 03:21:40,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 907 events. 442/907 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5074 event pairs, 67 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 2689. Up to 497 conditions per place. [2022-11-23 03:21:40,162 INFO L137 encePairwiseOnDemand]: 382/391 looper letters, 62 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2022-11-23 03:21:40,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 409 flow [2022-11-23 03:21:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:21:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:21:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2022-11-23 03:21:40,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.32821824381926684 [2022-11-23 03:21:40,167 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2022-11-23 03:21:40,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2022-11-23 03:21:40,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:40,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2022-11-23 03:21:40,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:40,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:40,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:40,176 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 137 flow. Second operand 6 states and 770 transitions. [2022-11-23 03:21:40,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 409 flow [2022-11-23 03:21:40,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:21:40,182 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 188 flow [2022-11-23 03:21:40,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2022-11-23 03:21:40,184 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -43 predicate places. [2022-11-23 03:21:40,184 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 188 flow [2022-11-23 03:21:40,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:40,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:40,185 INFO L209 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] [2022-11-23 03:21:40,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:40,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:40,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash -587435923, now seen corresponding path program 4 times [2022-11-23 03:21:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:40,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70101303] [2022-11-23 03:21:40,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:21:40,403 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 [2022-11-23 03:21:40,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:40,404 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:40,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (12)] Waiting until timeout for monitored process [2022-11-23 03:21:40,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:21:40,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:40,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 03:21:40,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:41,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:21:41,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2022-11-23 03:21:42,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-23 03:21:42,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-23 03:21:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:42,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:42,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:42,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70101303] [2022-11-23 03:21:42,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70101303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:42,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:42,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:21:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697721770] [2022-11-23 03:21:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:42,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:21:42,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:42,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:21:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:21:43,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 391 [2022-11-23 03:21:43,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 188 flow. Second operand has 8 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:43,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:43,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 391 [2022-11-23 03:21:43,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:45,062 INFO L130 PetriNetUnfolder]: 487/1024 cut-off events. [2022-11-23 03:21:45,062 INFO L131 PetriNetUnfolder]: For 1376/1376 co-relation queries the response was YES. [2022-11-23 03:21:45,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3494 conditions, 1024 events. 487/1024 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5968 event pairs, 113 based on Foata normal form. 1/1025 useless extension candidates. Maximal degree in co-relation 3483. Up to 479 conditions per place. [2022-11-23 03:21:45,067 INFO L137 encePairwiseOnDemand]: 384/391 looper letters, 64 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2022-11-23 03:21:45,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 468 flow [2022-11-23 03:21:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:21:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:21:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2022-11-23 03:21:45,071 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3256606990622336 [2022-11-23 03:21:45,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2022-11-23 03:21:45,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2022-11-23 03:21:45,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:45,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2022-11-23 03:21:45,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:45,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:45,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:45,081 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 188 flow. Second operand 6 states and 764 transitions. [2022-11-23 03:21:45,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 468 flow [2022-11-23 03:21:45,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:21:45,089 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 221 flow [2022-11-23 03:21:45,090 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-11-23 03:21:45,091 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2022-11-23 03:21:45,091 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 221 flow [2022-11-23 03:21:45,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:45,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:45,092 INFO L209 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] [2022-11-23 03:21:45,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (12)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:45,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:45,306 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:45,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 671680935, now seen corresponding path program 5 times [2022-11-23 03:21:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:45,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392848971] [2022-11-23 03:21:45,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:21:45,308 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 [2022-11-23 03:21:45,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:45,309 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:45,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (13)] Waiting until timeout for monitored process [2022-11-23 03:21:45,859 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 03:21:45,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:21:45,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 03:21:45,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:21:45,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:21:45,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:21:45,934 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:21:45,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:21:46,045 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 03:21:46,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 03:21:46,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:21:46,151 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:21:46,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 03:21:46,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 03:21:46,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2022-11-23 03:21:46,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-11-23 03:21:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:21:46,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:21:46,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:21:46,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392848971] [2022-11-23 03:21:46,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392848971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:21:46,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:21:46,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:21:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606143568] [2022-11-23 03:21:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:21:46,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:21:46,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:21:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:21:46,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:21:47,498 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 391 [2022-11-23 03:21:47,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:47,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:21:47,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 391 [2022-11-23 03:21:47,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:21:48,520 INFO L130 PetriNetUnfolder]: 690/1462 cut-off events. [2022-11-23 03:21:48,521 INFO L131 PetriNetUnfolder]: For 2468/2478 co-relation queries the response was YES. [2022-11-23 03:21:48,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 1462 events. 690/1462 cut-off events. For 2468/2478 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9366 event pairs, 267 based on Foata normal form. 11/1469 useless extension candidates. Maximal degree in co-relation 5346. Up to 792 conditions per place. [2022-11-23 03:21:48,528 INFO L137 encePairwiseOnDemand]: 383/391 looper letters, 80 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2022-11-23 03:21:48,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 667 flow [2022-11-23 03:21:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:21:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:21:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2022-11-23 03:21:48,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31859700401899893 [2022-11-23 03:21:48,533 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2022-11-23 03:21:48,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2022-11-23 03:21:48,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:21:48,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2022-11-23 03:21:48,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:48,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 391.0) internal successors, (3128), 8 states have internal predecessors, (3128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:48,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 391.0) internal successors, (3128), 8 states have internal predecessors, (3128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:48,543 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 221 flow. Second operand 7 states and 872 transitions. [2022-11-23 03:21:48,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 667 flow [2022-11-23 03:21:48,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 647 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:21:48,556 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 319 flow [2022-11-23 03:21:48,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2022-11-23 03:21:48,557 INFO L288 CegarLoopForPetriNet]: 97 programPoint places, -32 predicate places. [2022-11-23 03:21:48,557 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 319 flow [2022-11-23 03:21:48,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:21:48,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:21:48,559 INFO L209 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] [2022-11-23 03:21:48,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (13)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:48,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2022-11-23 03:21:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:21:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1509874455, now seen corresponding path program 6 times [2022-11-23 03:21:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:21:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718249793] [2022-11-23 03:21:48,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 03:21:48,760 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 [2022-11-23 03:21:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:21:48,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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) [2022-11-23 03:21:48,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (14)] Waiting until timeout for monitored process [2022-11-23 03:21:49,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-23 03:21:49,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 03:21:49,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:21:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:21:49,570 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 03:21:49,571 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:21:49,572 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2022-11-23 03:21:49,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2022-11-23 03:21:49,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2022-11-23 03:21:49,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2022-11-23 03:21:49,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2022-11-23 03:21:49,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2022-11-23 03:21:49,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2022-11-23 03:21:49,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2022-11-23 03:21:49,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2022-11-23 03:21:49,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2022-11-23 03:21:49,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2022-11-23 03:21:49,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2022-11-23 03:21:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2022-11-23 03:21:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2022-11-23 03:21:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2022-11-23 03:21:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2022-11-23 03:21:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2022-11-23 03:21:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2022-11-23 03:21:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2022-11-23 03:21:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2022-11-23 03:21:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2022-11-23 03:21:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2022-11-23 03:21:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2022-11-23 03:21:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2022-11-23 03:21:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2022-11-23 03:21:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2022-11-23 03:21:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2022-11-23 03:21:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2022-11-23 03:21:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2022-11-23 03:21:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2022-11-23 03:21:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2022-11-23 03:21:49,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2022-11-23 03:21:49,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2022-11-23 03:21:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2022-11-23 03:21:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2022-11-23 03:21:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2022-11-23 03:21:49,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2022-11-23 03:21:49,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2022-11-23 03:21:49,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2022-11-23 03:21:49,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2022-11-23 03:21:49,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2022-11-23 03:21:49,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2022-11-23 03:21:49,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2022-11-23 03:21:49,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2022-11-23 03:21:49,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2022-11-23 03:21:49,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2022-11-23 03:21:49,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2022-11-23 03:21:49,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2022-11-23 03:21:49,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2022-11-23 03:21:49,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2022-11-23 03:21:49,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2022-11-23 03:21:49,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2022-11-23 03:21:49,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2022-11-23 03:21:49,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2022-11-23 03:21:49,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2022-11-23 03:21:49,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2022-11-23 03:21:49,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2022-11-23 03:21:49,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2022-11-23 03:21:49,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2022-11-23 03:21:49,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2022-11-23 03:21:49,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2022-11-23 03:21:49,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2022-11-23 03:21:49,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2022-11-23 03:21:49,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2022-11-23 03:21:49,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2022-11-23 03:21:49,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2022-11-23 03:21:49,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2022-11-23 03:21:49,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2022-11-23 03:21:49,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2022-11-23 03:21:49,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2022-11-23 03:21:49,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2022-11-23 03:21:49,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2022-11-23 03:21:49,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2022-11-23 03:21:49,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2022-11-23 03:21:49,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2022-11-23 03:21:49,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2022-11-23 03:21:49,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2022-11-23 03:21:49,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2022-11-23 03:21:49,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2022-11-23 03:21:49,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2022-11-23 03:21:49,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2022-11-23 03:21:49,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2022-11-23 03:21:49,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2022-11-23 03:21:49,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 (14)] Forceful destruction successful, exit code 0 [2022-11-23 03:21:49,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 [2022-11-23 03:21:49,824 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:21:49,833 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:21:49,833 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:21:49,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:21:49 BasicIcfg [2022-11-23 03:21:49,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:21:49,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:21:49,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:21:49,946 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:21:49,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:19:33" (3/4) ... [2022-11-23 03:21:49,950 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:21:49,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:21:49,951 INFO L158 Benchmark]: Toolchain (without parser) took 139928.05ms. Allocated memory was 96.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 73.8MB in the beginning and 737.5MB in the end (delta: -663.8MB). Peak memory consumption was 650.4MB. Max. memory is 16.1GB. [2022-11-23 03:21:49,952 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 62.9MB. Free memory is still 41.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:21:49,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 926.16ms. Allocated memory is still 96.5MB. Free memory was 73.5MB in the beginning and 70.7MB in the end (delta: 2.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-11-23 03:21:49,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.61ms. Allocated memory is still 96.5MB. Free memory was 70.7MB in the beginning and 67.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:21:49,953 INFO L158 Benchmark]: Boogie Preprocessor took 96.47ms. Allocated memory is still 96.5MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:21:49,953 INFO L158 Benchmark]: RCFGBuilder took 2781.34ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 65.2MB in the beginning and 37.7MB in the end (delta: 27.6MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2022-11-23 03:21:49,954 INFO L158 Benchmark]: TraceAbstraction took 135966.96ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 36.6MB in the beginning and 738.6MB in the end (delta: -702.0MB). Peak memory consumption was 590.9MB. Max. memory is 16.1GB. [2022-11-23 03:21:49,954 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 1.4GB. Free memory is still 737.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:21:49,956 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 62.9MB. Free memory is still 41.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 926.16ms. Allocated memory is still 96.5MB. Free memory was 73.5MB in the beginning and 70.7MB in the end (delta: 2.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.61ms. Allocated memory is still 96.5MB. Free memory was 70.7MB in the beginning and 67.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.47ms. Allocated memory is still 96.5MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2781.34ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 65.2MB in the beginning and 37.7MB in the end (delta: 27.6MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * TraceAbstraction took 135966.96ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 36.6MB in the beginning and 738.6MB in the end (delta: -702.0MB). Peak memory consumption was 590.9MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 1.4GB. Free memory is still 737.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.2s, 202 PlacesBefore, 97 PlacesAfterwards, 194 TransitionsBefore, 88 TransitionsAfterwards, 8948 CoEnabledTransitionPairs, 8 FixpointIterations, 74 TrivialSequentialCompositions, 114 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 194 TotalNumberOfCompositions, 38821 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14872, independent: 14336, independent conditional: 0, independent unconditional: 14336, dependent: 529, dependent conditional: 0, dependent unconditional: 529, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5699, independent: 5596, independent conditional: 0, independent unconditional: 5596, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5699, independent: 4615, independent conditional: 0, independent unconditional: 4615, dependent: 1084, dependent conditional: 0, dependent unconditional: 1084, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1084, independent: 981, independent conditional: 0, independent unconditional: 981, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7669, independent: 5545, independent conditional: 0, independent unconditional: 5545, dependent: 1881, dependent conditional: 0, dependent unconditional: 1881, unknown: 243, unknown conditional: 0, unknown unconditional: 243] ], Cache Queries: [ total: 14872, independent: 8740, independent conditional: 0, independent unconditional: 8740, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 5702, unknown conditional: 0, unknown unconditional: 5702] , Statistics on independence cache: Total cache size (in pairs): 916, Positive cache size: 872, Positive conditional cache size: 0, Positive unconditional cache size: 872, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=262144, t1789={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t1790; VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1789={7:0}, t1790={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=262145, t1789={7:0}, t1790={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L856] 0 pthread_t t1791; VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={7:0}, t1790={14:0}, t1791={15:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=262146, t1789={7:0}, t1790={14:0}, t1791={15:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={7:0}, t1790={14:0}, t1791={15:0}, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=3, weak$$choice1=128, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 258 locations, 101 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: 135.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 101.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1113 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 792 mSDsluCounter, 542 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 505 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2339 IncrementalHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 37 mSDtfsCounter, 2339 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=12, InterpolantAutomatonStates: 54, 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.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2039 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2117 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 03:21:49,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a12e3d3-1bf6-48bb-89cd-54d8c1957d72/bin/uautomizer-QkZJyEgLgS/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample