./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/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 f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 --- 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:49:51,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:49:51,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:49:51,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:49:51,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:49:51,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:49:51,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:49:51,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:49:51,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:49:51,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:49:51,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:49:51,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:49:51,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:49:51,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:49:51,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:49:51,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:49:51,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:49:51,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:49:51,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:49:51,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:49:51,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:49:51,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:49:52,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:49:52,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:49:52,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:49:52,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:49:52,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:49:52,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:49:52,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:49:52,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:49:52,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:49:52,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:49:52,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:49:52,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:49:52,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:49:52,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:49:52,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:49:52,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:49:52,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:49:52,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:49:52,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:49:52,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:49:52,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:49:52,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:49:52,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:49:52,082 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:49:52,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:49:52,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:49:52,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:49:52,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:49:52,085 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:49:52,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:49:52,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:49:52,087 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:49:52,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:49:52,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:49:52,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:49:52,088 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:49:52,088 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:49:52,088 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:49:52,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:49:52,089 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:49:52,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:49:52,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:49:52,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:49:52,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:49:52,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:49:52,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:49:52,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:49:52,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:49:52,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:49:52,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:49:52,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:49:52,093 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:49:52,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:49:52,094 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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/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 -> f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 [2022-11-23 03:49:52,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:49:52,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:49:52,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:49:52,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:49:52,481 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:49:52,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2022-11-23 03:49:56,257 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:49:56,474 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:49:56,475 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2022-11-23 03:49:56,483 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/data/cdb4d50ac/30e93d4274fc49aeb16d3994f7064a05/FLAG8441ea9d7 [2022-11-23 03:49:56,500 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/data/cdb4d50ac/30e93d4274fc49aeb16d3994f7064a05 [2022-11-23 03:49:56,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:49:56,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:49:56,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:49:56,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:49:56,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:49:56,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1476bf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56, skipping insertion in model container [2022-11-23 03:49:56,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:49:56,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:49:56,738 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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-11-23 03:49:56,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:49:56,761 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:49:56,789 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_938a6c93-0bcd-43b8-addd-6ad91ca9b918/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-11-23 03:49:56,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:49:56,805 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:49:56,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56 WrapperNode [2022-11-23 03:49:56,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:49:56,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:49:56,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:49:56,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:49:56,815 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:49:56" (1/1) ... [2022-11-23 03:49:56,825 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:49:56" (1/1) ... [2022-11-23 03:49:56,850 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-11-23 03:49:56,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:49:56,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:49:56,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:49:56,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:49:56,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:49:56,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:49:56,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:49:56,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:49:56,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (1/1) ... [2022-11-23 03:49:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:49:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:49:56,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:49:56,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:49:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:49:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 03:49:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 03:49:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 03:49:56,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 03:49:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-23 03:49:56,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-23 03:49:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-23 03:49:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-23 03:49:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:49:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:49:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:49:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:49:56,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:49:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:49:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:49:56,992 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:49:57,122 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:49:57,126 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:49:57,742 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:49:57,753 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:49:57,754 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 03:49:57,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:57 BoogieIcfgContainer [2022-11-23 03:49:57,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:49:57,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:49:57,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:49:57,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:49:57,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:49:56" (1/3) ... [2022-11-23 03:49:57,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d0116c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:57, skipping insertion in model container [2022-11-23 03:49:57,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:56" (2/3) ... [2022-11-23 03:49:57,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d0116c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:49:57, skipping insertion in model container [2022-11-23 03:49:57,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:57" (3/3) ... [2022-11-23 03:49:57,778 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-11-23 03:49:57,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:49:57,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 03:49:57,812 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:49:57,962 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-23 03:49:58,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 149 transitions, 330 flow [2022-11-23 03:49:58,116 INFO L130 PetriNetUnfolder]: 10/145 cut-off events. [2022-11-23 03:49:58,116 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:49:58,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 145 events. 10/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-11-23 03:49:58,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 149 transitions, 330 flow [2022-11-23 03:49:58,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 140 transitions, 304 flow [2022-11-23 03:49:58,138 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:49:58,158 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 140 transitions, 304 flow [2022-11-23 03:49:58,162 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 140 transitions, 304 flow [2022-11-23 03:49:58,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 140 transitions, 304 flow [2022-11-23 03:49:58,215 INFO L130 PetriNetUnfolder]: 10/140 cut-off events. [2022-11-23 03:49:58,216 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:49:58,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 140 events. 10/140 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-11-23 03:49:58,220 INFO L119 LiptonReduction]: Number of co-enabled transitions 1960 [2022-11-23 03:50:05,645 INFO L134 LiptonReduction]: Checked pairs total: 2359 [2022-11-23 03:50:05,646 INFO L136 LiptonReduction]: Total number of compositions: 137 [2022-11-23 03:50:05,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:50:05,671 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;@2b325082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:50:05,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-23 03:50:05,673 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 03:50:05,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:50:05,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:05,675 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 03:50:05,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash 537, now seen corresponding path program 1 times [2022-11-23 03:50:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:05,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881076134] [2022-11-23 03:50:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:05,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:05,806 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:50:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:05,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881076134] [2022-11-23 03:50:05,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881076134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:05,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 03:50:05,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177364617] [2022-11-23 03:50:05,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:05,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:50:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:50:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:50:05,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 286 [2022-11-23 03:50:05,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 108 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:50:05,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:05,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 286 [2022-11-23 03:50:05,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:06,086 INFO L130 PetriNetUnfolder]: 513/692 cut-off events. [2022-11-23 03:50:06,086 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-23 03:50:06,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1652 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2022-11-23 03:50:06,100 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2022-11-23 03:50:06,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2022-11-23 03:50:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:50:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 03:50:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions. [2022-11-23 03:50:06,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.541958041958042 [2022-11-23 03:50:06,130 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 310 transitions. [2022-11-23 03:50:06,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions. [2022-11-23 03:50:06,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:06,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions. [2022-11-23 03:50:06,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 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:50:06,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 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:50:06,157 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 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:50:06,159 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 108 flow. Second operand 2 states and 310 transitions. [2022-11-23 03:50:06,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2022-11-23 03:50:06,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-23 03:50:06,169 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2022-11-23 03:50:06,171 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-11-23 03:50:06,177 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-23 03:50:06,177 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2022-11-23 03:50:06,178 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:50:06,178 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:06,178 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:50:06,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:50:06,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash 529767, now seen corresponding path program 1 times [2022-11-23 03:50:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054576146] [2022-11-23 03:50:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:06,807 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:50:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054576146] [2022-11-23 03:50:06,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054576146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:06,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:06,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977042561] [2022-11-23 03:50:06,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:06,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:06,915 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 286 [2022-11-23 03:50:06,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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:50:06,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:06,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 286 [2022-11-23 03:50:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:07,063 INFO L130 PetriNetUnfolder]: 487/656 cut-off events. [2022-11-23 03:50:07,064 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:07,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1538 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2022-11-23 03:50:07,069 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2022-11-23 03:50:07,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2022-11-23 03:50:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2022-11-23 03:50:07,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.479020979020979 [2022-11-23 03:50:07,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2022-11-23 03:50:07,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2022-11-23 03:50:07,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:07,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2022-11-23 03:50:07,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:50:07,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:07,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:07,079 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 411 transitions. [2022-11-23 03:50:07,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2022-11-23 03:50:07,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:50:07,081 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2022-11-23 03:50:07,081 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-11-23 03:50:07,082 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-23 03:50:07,082 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2022-11-23 03:50:07,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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:50:07,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:07,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:50:07,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:50:07,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 529766, now seen corresponding path program 1 times [2022-11-23 03:50:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:07,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445619038] [2022-11-23 03:50:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:07,290 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:50:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:07,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445619038] [2022-11-23 03:50:07,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445619038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:07,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:07,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798728660] [2022-11-23 03:50:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:07,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:07,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2022-11-23 03:50:07,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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:50:07,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:07,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2022-11-23 03:50:07,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:07,561 INFO L130 PetriNetUnfolder]: 461/620 cut-off events. [2022-11-23 03:50:07,562 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:07,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1429 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2022-11-23 03:50:07,568 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-11-23 03:50:07,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2022-11-23 03:50:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-11-23 03:50:07,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4731934731934732 [2022-11-23 03:50:07,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-11-23 03:50:07,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-11-23 03:50:07,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:07,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-11-23 03:50:07,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 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:50:07,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:07,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:07,580 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 406 transitions. [2022-11-23 03:50:07,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2022-11-23 03:50:07,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:07,583 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2022-11-23 03:50:07,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2022-11-23 03:50:07,585 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-23 03:50:07,586 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2022-11-23 03:50:07,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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:50:07,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:07,587 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 03:50:07,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:50:07,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 509115832, now seen corresponding path program 1 times [2022-11-23 03:50:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886593324] [2022-11-23 03:50:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:07,811 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:50:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:07,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886593324] [2022-11-23 03:50:07,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886593324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:07,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160370698] [2022-11-23 03:50:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:07,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:07,915 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2022-11-23 03:50:07,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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:50:07,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:07,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2022-11-23 03:50:07,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:08,045 INFO L130 PetriNetUnfolder]: 445/596 cut-off events. [2022-11-23 03:50:08,046 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:08,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1359 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2022-11-23 03:50:08,055 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2022-11-23 03:50:08,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2022-11-23 03:50:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2022-11-23 03:50:08,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47086247086247085 [2022-11-23 03:50:08,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2022-11-23 03:50:08,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2022-11-23 03:50:08,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:08,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2022-11-23 03:50:08,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:50:08,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:08,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:08,071 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 404 transitions. [2022-11-23 03:50:08,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2022-11-23 03:50:08,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:08,074 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2022-11-23 03:50:08,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-11-23 03:50:08,077 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2022-11-23 03:50:08,077 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2022-11-23 03:50:08,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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:50:08,078 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:08,078 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 03:50:08,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:50:08,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:08,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 509115831, now seen corresponding path program 1 times [2022-11-23 03:50:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:08,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088634453] [2022-11-23 03:50:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:08,212 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:50:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088634453] [2022-11-23 03:50:08,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088634453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:08,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:08,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:08,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646069709] [2022-11-23 03:50:08,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:08,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:08,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:08,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:08,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:08,300 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2022-11-23 03:50:08,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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:50:08,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:08,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2022-11-23 03:50:08,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:08,415 INFO L130 PetriNetUnfolder]: 429/572 cut-off events. [2022-11-23 03:50:08,415 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:08,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1285 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2022-11-23 03:50:08,420 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2022-11-23 03:50:08,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2022-11-23 03:50:08,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-11-23 03:50:08,423 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48951048951048953 [2022-11-23 03:50:08,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2022-11-23 03:50:08,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2022-11-23 03:50:08,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:08,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2022-11-23 03:50:08,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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:50:08,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:08,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:08,431 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 420 transitions. [2022-11-23 03:50:08,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2022-11-23 03:50:08,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:08,433 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2022-11-23 03:50:08,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-11-23 03:50:08,436 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2022-11-23 03:50:08,436 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2022-11-23 03:50:08,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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:50:08,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:08,437 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:08,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:50:08,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:08,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash -365944373, now seen corresponding path program 1 times [2022-11-23 03:50:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:08,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115602825] [2022-11-23 03:50:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:08,548 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:50:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:08,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115602825] [2022-11-23 03:50:08,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115602825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:08,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:08,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633123169] [2022-11-23 03:50:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:08,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:08,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2022-11-23 03:50:08,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:50:08,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:08,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2022-11-23 03:50:08,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:08,768 INFO L130 PetriNetUnfolder]: 403/536 cut-off events. [2022-11-23 03:50:08,769 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:08,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1183 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2022-11-23 03:50:08,773 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2022-11-23 03:50:08,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2022-11-23 03:50:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2022-11-23 03:50:08,777 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4662004662004662 [2022-11-23 03:50:08,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2022-11-23 03:50:08,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2022-11-23 03:50:08,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:08,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2022-11-23 03:50:08,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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:50:08,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:08,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:08,784 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 400 transitions. [2022-11-23 03:50:08,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2022-11-23 03:50:08,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:08,786 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2022-11-23 03:50:08,787 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-11-23 03:50:08,789 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2022-11-23 03:50:08,790 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2022-11-23 03:50:08,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:50:08,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:08,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:08,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:50:08,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash -365944374, now seen corresponding path program 1 times [2022-11-23 03:50:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:08,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391481585] [2022-11-23 03:50:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:08,909 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:50:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:08,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391481585] [2022-11-23 03:50:08,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391481585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:08,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:08,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894294714] [2022-11-23 03:50:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:08,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:08,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:08,979 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2022-11-23 03:50:08,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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:50:08,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:08,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2022-11-23 03:50:08,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:09,085 INFO L130 PetriNetUnfolder]: 377/500 cut-off events. [2022-11-23 03:50:09,085 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:09,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1073 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2022-11-23 03:50:09,089 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2022-11-23 03:50:09,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2022-11-23 03:50:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-11-23 03:50:09,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-11-23 03:50:09,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2022-11-23 03:50:09,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2022-11-23 03:50:09,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:09,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2022-11-23 03:50:09,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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:50:09,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:09,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:09,099 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 416 transitions. [2022-11-23 03:50:09,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2022-11-23 03:50:09,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:09,103 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2022-11-23 03:50:09,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-11-23 03:50:09,104 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-11-23 03:50:09,104 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2022-11-23 03:50:09,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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:50:09,105 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:09,105 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:09,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:50:09,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash 514788493, now seen corresponding path program 1 times [2022-11-23 03:50:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:09,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250065642] [2022-11-23 03:50:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:09,566 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:50:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:09,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250065642] [2022-11-23 03:50:09,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250065642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:09,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:09,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:50:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444907704] [2022-11-23 03:50:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:09,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:50:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:09,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:50:09,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:50:09,705 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2022-11-23 03:50:09,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:50:09,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:09,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2022-11-23 03:50:09,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:09,827 INFO L130 PetriNetUnfolder]: 313/420 cut-off events. [2022-11-23 03:50:09,827 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:09,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 856 event pairs, 149 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 861. Up to 420 conditions per place. [2022-11-23 03:50:09,831 INFO L137 encePairwiseOnDemand]: 284/286 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2022-11-23 03:50:09,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2022-11-23 03:50:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-11-23 03:50:09,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46853146853146854 [2022-11-23 03:50:09,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2022-11-23 03:50:09,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2022-11-23 03:50:09,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:09,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2022-11-23 03:50:09,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:50:09,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:09,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:09,839 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 402 transitions. [2022-11-23 03:50:09,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2022-11-23 03:50:09,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:09,842 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2022-11-23 03:50:09,842 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-11-23 03:50:09,845 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-11-23 03:50:09,845 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2022-11-23 03:50:09,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:50:09,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:09,846 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:50:09,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:50:09,847 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 514788492, now seen corresponding path program 1 times [2022-11-23 03:50:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:09,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929915888] [2022-11-23 03:50:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:10,111 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:50:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929915888] [2022-11-23 03:50:10,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929915888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:10,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:10,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:50:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100734858] [2022-11-23 03:50:10,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:10,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:50:10,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:50:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:50:10,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 286 [2022-11-23 03:50:10,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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:50:10,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:10,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 286 [2022-11-23 03:50:10,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:10,371 INFO L130 PetriNetUnfolder]: 249/340 cut-off events. [2022-11-23 03:50:10,371 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 03:50:10,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 646 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2022-11-23 03:50:10,374 INFO L137 encePairwiseOnDemand]: 284/286 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2022-11-23 03:50:10,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2022-11-23 03:50:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-11-23 03:50:10,377 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4184149184149184 [2022-11-23 03:50:10,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-11-23 03:50:10,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-11-23 03:50:10,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:10,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-11-23 03:50:10,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:50:10,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:10,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:10,382 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 359 transitions. [2022-11-23 03:50:10,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2022-11-23 03:50:10,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:10,384 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2022-11-23 03:50:10,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-11-23 03:50:10,385 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-11-23 03:50:10,386 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2022-11-23 03:50:10,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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:50:10,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:10,387 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] [2022-11-23 03:50:10,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:50:10,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1842013647, now seen corresponding path program 1 times [2022-11-23 03:50:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:10,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512740603] [2022-11-23 03:50:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:10,719 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:50:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:10,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512740603] [2022-11-23 03:50:10,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512740603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:10,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:10,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:50:10,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306093370] [2022-11-23 03:50:10,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:10,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:50:10,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:10,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:50:10,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:50:10,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2022-11-23 03:50:10,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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:50:10,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:10,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2022-11-23 03:50:10,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:11,011 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-11-23 03:50:11,011 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-23 03:50:11,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1782 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2022-11-23 03:50:11,017 INFO L137 encePairwiseOnDemand]: 280/286 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-11-23 03:50:11,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2022-11-23 03:50:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:50:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:50:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-11-23 03:50:11,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46853146853146854 [2022-11-23 03:50:11,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2022-11-23 03:50:11,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2022-11-23 03:50:11,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:11,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2022-11-23 03:50:11,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:50:11,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:11,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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:50:11,025 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 402 transitions. [2022-11-23 03:50:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2022-11-23 03:50:11,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:11,027 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2022-11-23 03:50:11,027 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-11-23 03:50:11,028 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2022-11-23 03:50:11,028 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2022-11-23 03:50:11,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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:50:11,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:11,029 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:50:11,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:50:11,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1000535246, now seen corresponding path program 1 times [2022-11-23 03:50:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198492470] [2022-11-23 03:50:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:11,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198492470] [2022-11-23 03:50:11,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198492470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:11,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:11,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726166279] [2022-11-23 03:50:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:11,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:50:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:11,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:50:11,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:50:11,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:11,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:11,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:11,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:11,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:11,706 INFO L130 PetriNetUnfolder]: 693/951 cut-off events. [2022-11-23 03:50:11,706 INFO L131 PetriNetUnfolder]: For 343/343 co-relation queries the response was YES. [2022-11-23 03:50:11,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 951 events. 693/951 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2753 event pairs, 67 based on Foata normal form. 32/983 useless extension candidates. Maximal degree in co-relation 2420. Up to 371 conditions per place. [2022-11-23 03:50:11,715 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 68 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2022-11-23 03:50:11,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 78 transitions, 395 flow [2022-11-23 03:50:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-23 03:50:11,719 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4699300699300699 [2022-11-23 03:50:11,719 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-23 03:50:11,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-23 03:50:11,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:11,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-23 03:50:11,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:50:11,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:11,762 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:11,762 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 5 states and 672 transitions. [2022-11-23 03:50:11,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 78 transitions, 395 flow [2022-11-23 03:50:11,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:11,765 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 159 flow [2022-11-23 03:50:11,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-23 03:50:11,765 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-11-23 03:50:11,766 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 159 flow [2022-11-23 03:50:11,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:11,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:11,766 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:50:11,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:50:11,771 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1986629398, now seen corresponding path program 1 times [2022-11-23 03:50:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:11,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325711276] [2022-11-23 03:50:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:12,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325711276] [2022-11-23 03:50:12,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325711276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172226428] [2022-11-23 03:50:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:12,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:50:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:12,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:50:12,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:50:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:12,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:50:12,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:50:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:12,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:50:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:12,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172226428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:50:12,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:50:12,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-23 03:50:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876477555] [2022-11-23 03:50:12,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:50:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:50:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:12,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:50:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:50:12,797 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:12,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 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:50:12,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:12,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:12,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:13,341 INFO L130 PetriNetUnfolder]: 1309/1809 cut-off events. [2022-11-23 03:50:13,341 INFO L131 PetriNetUnfolder]: For 1957/1957 co-relation queries the response was YES. [2022-11-23 03:50:13,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 1809 events. 1309/1809 cut-off events. For 1957/1957 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6368 event pairs, 291 based on Foata normal form. 68/1877 useless extension candidates. Maximal degree in co-relation 5610. Up to 757 conditions per place. [2022-11-23 03:50:13,359 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 98 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2022-11-23 03:50:13,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 106 transitions, 649 flow [2022-11-23 03:50:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2022-11-23 03:50:13,362 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2022-11-23 03:50:13,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2022-11-23 03:50:13,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2022-11-23 03:50:13,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:13,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2022-11-23 03:50:13,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:50:13,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:13,370 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:13,370 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 159 flow. Second operand 5 states and 682 transitions. [2022-11-23 03:50:13,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 106 transitions, 649 flow [2022-11-23 03:50:13,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 106 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:50:13,381 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 214 flow [2022-11-23 03:50:13,381 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-11-23 03:50:13,382 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-11-23 03:50:13,382 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 214 flow [2022-11-23 03:50:13,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 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:50:13,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:13,383 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:50:13,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:50:13,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 03:50:13,593 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1378612582, now seen corresponding path program 2 times [2022-11-23 03:50:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:13,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739985067] [2022-11-23 03:50:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739985067] [2022-11-23 03:50:13,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739985067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:13,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:13,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983537968] [2022-11-23 03:50:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:13,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:50:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:50:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:50:13,993 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:13,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:13,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:13,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:14,413 INFO L130 PetriNetUnfolder]: 1105/1509 cut-off events. [2022-11-23 03:50:14,413 INFO L131 PetriNetUnfolder]: For 2585/2585 co-relation queries the response was YES. [2022-11-23 03:50:14,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 1509 events. 1105/1509 cut-off events. For 2585/2585 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5155 event pairs, 89 based on Foata normal form. 26/1535 useless extension candidates. Maximal degree in co-relation 5563. Up to 620 conditions per place. [2022-11-23 03:50:14,429 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 94 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2022-11-23 03:50:14,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 105 transitions, 705 flow [2022-11-23 03:50:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2022-11-23 03:50:14,433 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2022-11-23 03:50:14,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2022-11-23 03:50:14,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2022-11-23 03:50:14,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:14,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2022-11-23 03:50:14,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 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:50:14,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:14,442 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:14,442 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 214 flow. Second operand 5 states and 676 transitions. [2022-11-23 03:50:14,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 105 transitions, 705 flow [2022-11-23 03:50:14,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 105 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:50:14,457 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 275 flow [2022-11-23 03:50:14,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2022-11-23 03:50:14,459 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-11-23 03:50:14,460 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 275 flow [2022-11-23 03:50:14,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:14,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:14,461 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:50:14,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:50:14,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:14,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash -845015146, now seen corresponding path program 1 times [2022-11-23 03:50:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:14,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773863720] [2022-11-23 03:50:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773863720] [2022-11-23 03:50:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773863720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:14,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:14,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:14,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33242929] [2022-11-23 03:50:14,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:14,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:50:14,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:14,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:50:14,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:50:14,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:14,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:14,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:14,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:14,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:15,262 INFO L130 PetriNetUnfolder]: 1063/1467 cut-off events. [2022-11-23 03:50:15,263 INFO L131 PetriNetUnfolder]: For 3385/3385 co-relation queries the response was YES. [2022-11-23 03:50:15,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5799 conditions, 1467 events. 1063/1467 cut-off events. For 3385/3385 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5114 event pairs, 83 based on Foata normal form. 42/1509 useless extension candidates. Maximal degree in co-relation 5786. Up to 619 conditions per place. [2022-11-23 03:50:15,282 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 93 selfloop transitions, 8 changer transitions 2/103 dead transitions. [2022-11-23 03:50:15,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 718 flow [2022-11-23 03:50:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2022-11-23 03:50:15,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47202797202797203 [2022-11-23 03:50:15,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2022-11-23 03:50:15,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2022-11-23 03:50:15,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:15,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2022-11-23 03:50:15,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 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:50:15,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:15,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:15,295 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 275 flow. Second operand 5 states and 675 transitions. [2022-11-23 03:50:15,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 718 flow [2022-11-23 03:50:15,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 707 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:15,309 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 278 flow [2022-11-23 03:50:15,310 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2022-11-23 03:50:15,311 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2022-11-23 03:50:15,311 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 278 flow [2022-11-23 03:50:15,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:15,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:15,312 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:50:15,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:50:15,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -799665733, now seen corresponding path program 1 times [2022-11-23 03:50:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:15,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907523794] [2022-11-23 03:50:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907523794] [2022-11-23 03:50:15,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907523794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:15,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345936993] [2022-11-23 03:50:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:50:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:15,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:50:15,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:50:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:15,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:50:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:50:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:16,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:50:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:16,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345936993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:50:16,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:50:16,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-23 03:50:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660310664] [2022-11-23 03:50:16,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:50:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:50:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:50:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:50:16,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:16,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 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:50:16,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:16,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:16,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:17,078 INFO L130 PetriNetUnfolder]: 1407/1959 cut-off events. [2022-11-23 03:50:17,078 INFO L131 PetriNetUnfolder]: For 4962/4962 co-relation queries the response was YES. [2022-11-23 03:50:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8049 conditions, 1959 events. 1407/1959 cut-off events. For 4962/4962 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7077 event pairs, 287 based on Foata normal form. 72/2031 useless extension candidates. Maximal degree in co-relation 8035. Up to 786 conditions per place. [2022-11-23 03:50:17,106 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 104 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2022-11-23 03:50:17,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 114 transitions, 901 flow [2022-11-23 03:50:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2022-11-23 03:50:17,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47132867132867134 [2022-11-23 03:50:17,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2022-11-23 03:50:17,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2022-11-23 03:50:17,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:17,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2022-11-23 03:50:17,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 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:50:17,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:17,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:17,118 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 278 flow. Second operand 5 states and 674 transitions. [2022-11-23 03:50:17,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 114 transitions, 901 flow [2022-11-23 03:50:17,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 868 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:17,135 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 323 flow [2022-11-23 03:50:17,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2022-11-23 03:50:17,137 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2022-11-23 03:50:17,137 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 323 flow [2022-11-23 03:50:17,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 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:50:17,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:17,138 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:50:17,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:50:17,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 03:50:17,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash -511659135, now seen corresponding path program 2 times [2022-11-23 03:50:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:17,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235029815] [2022-11-23 03:50:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:17,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235029815] [2022-11-23 03:50:17,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235029815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:17,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:17,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715983000] [2022-11-23 03:50:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:17,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:50:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:50:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:50:17,640 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:17,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:17,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:17,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:17,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:18,089 INFO L130 PetriNetUnfolder]: 1237/1713 cut-off events. [2022-11-23 03:50:18,090 INFO L131 PetriNetUnfolder]: For 4448/4448 co-relation queries the response was YES. [2022-11-23 03:50:18,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7564 conditions, 1713 events. 1237/1713 cut-off events. For 4448/4448 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6053 event pairs, 65 based on Foata normal form. 34/1747 useless extension candidates. Maximal degree in co-relation 7547. Up to 672 conditions per place. [2022-11-23 03:50:18,111 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 98 selfloop transitions, 9 changer transitions 4/111 dead transitions. [2022-11-23 03:50:18,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 883 flow [2022-11-23 03:50:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2022-11-23 03:50:18,115 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2022-11-23 03:50:18,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2022-11-23 03:50:18,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2022-11-23 03:50:18,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:18,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2022-11-23 03:50:18,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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:50:18,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:18,123 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:18,123 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 323 flow. Second operand 5 states and 671 transitions. [2022-11-23 03:50:18,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 883 flow [2022-11-23 03:50:18,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 111 transitions, 874 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:18,147 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 327 flow [2022-11-23 03:50:18,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2022-11-23 03:50:18,148 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2022-11-23 03:50:18,148 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 327 flow [2022-11-23 03:50:18,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:18,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:18,149 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:50:18,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 03:50:18,150 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash 719733196, now seen corresponding path program 2 times [2022-11-23 03:50:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:18,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865646750] [2022-11-23 03:50:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:18,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:18,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:18,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865646750] [2022-11-23 03:50:18,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865646750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:18,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569038763] [2022-11-23 03:50:18,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:50:18,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:50:18,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:18,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:50:18,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:50:18,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:50:18,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:50:18,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:50:18,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:50:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:18,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:50:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:18,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569038763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:50:18,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:50:18,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-23 03:50:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047876596] [2022-11-23 03:50:18,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:50:18,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:50:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:50:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:50:18,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:18,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 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:50:18,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:18,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:18,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:19,469 INFO L130 PetriNetUnfolder]: 1441/1985 cut-off events. [2022-11-23 03:50:19,469 INFO L131 PetriNetUnfolder]: For 5412/5412 co-relation queries the response was YES. [2022-11-23 03:50:19,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 1985 events. 1441/1985 cut-off events. For 5412/5412 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6986 event pairs, 257 based on Foata normal form. 68/2053 useless extension candidates. Maximal degree in co-relation 9176. Up to 1119 conditions per place. [2022-11-23 03:50:19,500 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 101 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2022-11-23 03:50:19,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 903 flow [2022-11-23 03:50:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2022-11-23 03:50:19,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4671328671328671 [2022-11-23 03:50:19,505 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2022-11-23 03:50:19,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2022-11-23 03:50:19,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:19,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2022-11-23 03:50:19,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 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:50:19,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:19,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:19,512 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 327 flow. Second operand 5 states and 668 transitions. [2022-11-23 03:50:19,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 903 flow [2022-11-23 03:50:19,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 896 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:19,527 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 374 flow [2022-11-23 03:50:19,527 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2022-11-23 03:50:19,528 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2022-11-23 03:50:19,528 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 374 flow [2022-11-23 03:50:19,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 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:50:19,529 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:19,529 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:50:19,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 03:50:19,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 03:50:19,737 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:19,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash -46510628, now seen corresponding path program 2 times [2022-11-23 03:50:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:19,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919992280] [2022-11-23 03:50:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:19,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919992280] [2022-11-23 03:50:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919992280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:50:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:50:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:50:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858930934] [2022-11-23 03:50:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:50:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:50:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:50:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:50:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:50:20,048 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 286 [2022-11-23 03:50:20,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:20,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:50:20,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 286 [2022-11-23 03:50:20,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:50:20,670 INFO L130 PetriNetUnfolder]: 1657/2269 cut-off events. [2022-11-23 03:50:20,670 INFO L131 PetriNetUnfolder]: For 8589/8589 co-relation queries the response was YES. [2022-11-23 03:50:20,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11185 conditions, 2269 events. 1657/2269 cut-off events. For 8589/8589 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8145 event pairs, 481 based on Foata normal form. 68/2337 useless extension candidates. Maximal degree in co-relation 11164. Up to 1331 conditions per place. [2022-11-23 03:50:20,699 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 117 selfloop transitions, 8 changer transitions 0/125 dead transitions. [2022-11-23 03:50:20,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 1162 flow [2022-11-23 03:50:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:50:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:50:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-23 03:50:20,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4699300699300699 [2022-11-23 03:50:20,703 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-23 03:50:20,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-23 03:50:20,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:50:20,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-23 03:50:20,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:50:20,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:20,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 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:50:20,710 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 374 flow. Second operand 5 states and 672 transitions. [2022-11-23 03:50:20,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 1162 flow [2022-11-23 03:50:20,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1105 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-11-23 03:50:20,736 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 408 flow [2022-11-23 03:50:20,736 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2022-11-23 03:50:20,737 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2022-11-23 03:50:20,737 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 408 flow [2022-11-23 03:50:20,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:50:20,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:50:20,739 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, 1] [2022-11-23 03:50:20,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 03:50:20,739 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:50:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:50:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 436232549, now seen corresponding path program 1 times [2022-11-23 03:50:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:50:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965263512] [2022-11-23 03:50:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:50:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:50:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:50:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965263512] [2022-11-23 03:50:21,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965263512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:50:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937517384] [2022-11-23 03:50:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:50:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:50:21,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:50:21,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:50:21,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:50:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:50:22,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 03:50:22,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:24,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:51:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:38,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937517384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:51:38,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:51:38,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-11-23 03:51:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351200018] [2022-11-23 03:51:38,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:51:38,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 03:51:38,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:38,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 03:51:38,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=145, Unknown=13, NotChecked=0, Total=210 [2022-11-23 03:51:40,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:42,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:44,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:46,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:48,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:50,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:52,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:54,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:56,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:51:58,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:00,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:02,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:04,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:04,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 286 [2022-11-23 03:52:04,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 408 flow. Second operand has 15 states, 15 states have (on average 110.06666666666666) internal successors, (1651), 15 states have internal predecessors, (1651), 0 states have call successors, (0), 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:52:04,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:52:04,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 286 [2022-11-23 03:52:04,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:52:07,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:18,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:20,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:21,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:23,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:52:39,435 WARN L233 SmtUtils]: Spent 13.12s on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:53:36,498 WARN L233 SmtUtils]: Spent 53.86s on a formula simplification. DAG size of input: 84 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:53:39,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:40,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:44,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:46,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:49,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:51,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:53,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:53:59,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:10,818 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 87 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:54:13,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:26,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:28,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:30,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:32,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:34,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:36,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:38,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:40,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:42,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:44,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:46,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:53,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:57,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:54:59,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:01,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:03,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:05,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:07,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:13,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:23,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:27,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:31,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:35,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:37,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:40,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:42,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:45,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:47,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:50,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:52,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:54,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:55:57,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:00,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:05,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:09,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:12,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:14,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:16,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:19,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:34,407 WARN L233 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 68 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:56:36,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:39,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:44,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:46,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:48,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:50,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:52,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:56,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:56:58,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:57:00,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:57:06,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:57:09,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:57:14,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:57:16,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:57:18,498 INFO L130 PetriNetUnfolder]: 4159/5790 cut-off events. [2022-11-23 03:57:18,498 INFO L131 PetriNetUnfolder]: For 18988/18988 co-relation queries the response was YES. [2022-11-23 03:57:18,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28409 conditions, 5790 events. 4159/5790 cut-off events. For 18988/18988 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26417 event pairs, 213 based on Foata normal form. 25/5815 useless extension candidates. Maximal degree in co-relation 28385. Up to 2867 conditions per place. [2022-11-23 03:57:18,563 INFO L137 encePairwiseOnDemand]: 267/286 looper letters, 302 selfloop transitions, 158 changer transitions 30/490 dead transitions. [2022-11-23 03:57:18,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 490 transitions, 3967 flow [2022-11-23 03:57:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 03:57:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-23 03:57:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3128 transitions. [2022-11-23 03:57:18,573 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.420656266810113 [2022-11-23 03:57:18,574 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3128 transitions. [2022-11-23 03:57:18,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3128 transitions. [2022-11-23 03:57:18,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:57:18,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3128 transitions. [2022-11-23 03:57:18,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 120.3076923076923) internal successors, (3128), 26 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:57:18,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 286.0) internal successors, (7722), 27 states have internal predecessors, (7722), 0 states have call successors, (0), 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:57:18,599 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 286.0) internal successors, (7722), 27 states have internal predecessors, (7722), 0 states have call successors, (0), 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:57:18,599 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 408 flow. Second operand 26 states and 3128 transitions. [2022-11-23 03:57:18,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 490 transitions, 3967 flow [2022-11-23 03:57:18,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 490 transitions, 3899 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-11-23 03:57:18,662 INFO L231 Difference]: Finished difference. Result has 118 places, 215 transitions, 2343 flow [2022-11-23 03:57:18,662 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2343, PETRI_PLACES=118, PETRI_TRANSITIONS=215} [2022-11-23 03:57:18,663 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2022-11-23 03:57:18,663 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 215 transitions, 2343 flow [2022-11-23 03:57:18,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 110.06666666666666) internal successors, (1651), 15 states have internal predecessors, (1651), 0 states have call successors, (0), 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:57:18,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:57:18,665 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, 1] [2022-11-23 03:57:18,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:57:18,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:57:18,872 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 03:57:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1119246198, now seen corresponding path program 1 times [2022-11-23 03:57:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:18,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861585185] [2022-11-23 03:57:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:57:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:19,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861585185] [2022-11-23 03:57:19,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861585185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:57:19,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517451723] [2022-11-23 03:57:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:57:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:57:19,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:57:19,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:57:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:21,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 03:57:21,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:57:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:57:51,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:58:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:58:05,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517451723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:58:05,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:58:05,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-23 03:58:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025705891] [2022-11-23 03:58:05,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:58:05,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 03:58:05,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:05,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 03:58:05,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=168, Unknown=17, NotChecked=0, Total=240 [2022-11-23 03:58:07,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:09,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:11,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:13,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:15,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:17,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:19,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:21,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:21,588 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 286 [2022-11-23 03:58:21,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 215 transitions, 2343 flow. Second operand has 16 states, 16 states have (on average 110.0625) internal successors, (1761), 16 states have internal predecessors, (1761), 0 states have call successors, (0), 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:58:21,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:58:21,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 286 [2022-11-23 03:58:21,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:58:25,208 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse3 (* 4 c_~x4~0)) (.cse1 (mod (div c_~x3~0 4) 4294967296)) (.cse11 (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (.cse2 (* 4294967296 (div c_~n~0 4294967296))) (.cse4 (* (- 4) c_~x4~0))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod c_~x3~0 4) 0) (= .cse1 (mod c_~x4~0 4294967296)) (<= (+ c_~x3~0 .cse2) (+ .cse3 (* (div (+ .cse4 (- 2) c_~x3~0 c_~n~0) 4294967296) 4294967296))) (< .cse1 (mod c_~n~0 4294967296)) (let ((.cse7 (mod c_~x4~0 1073741824))) (let ((.cse5 (* (div .cse7 1073741824) 4294967296)) (.cse6 (+ (mod c_~x3~0 4294967296) 1))) (or (< (+ .cse5 (* 4 (mod c_~x3~0 1073741824))) .cse6) (< (+ (* .cse7 4) .cse5) .cse6) (let ((.cse10 (* c_~x3~0 4))) (let ((.cse9 (* (div .cse3 4294967296) 4294967296)) (.cse8 (+ .cse3 (* 4294967296 (div .cse10 4294967296))))) (and (< .cse8 (+ .cse9 .cse10 1)) .cse11 (<= (+ .cse9 .cse10) .cse8))))))) (< 0 .cse1) .cse11 (let ((.cse13 (* 1073741824 (div c_~x3~0 4294967296))) (.cse12 (div (+ .cse4 c_~x3~0) 4294967296))) (or (<= (+ c_~x3~0 1073741825 .cse2) (+ (* 3 c_~x4~0) (* .cse12 3221225472) c_~n~0 .cse13)) (<= (+ 1 .cse13) (+ (* 1073741824 .cse12) c_~x4~0)))))) is different from false [2022-11-23 03:58:34,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:36,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:38,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:40,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:44,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:47,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:49,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:51,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:53,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:58:56,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:04,891 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 64 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:59:06,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:08,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:17,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:19,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:21,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:23,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:24,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:26,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:31,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:35,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:38,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:40,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:42,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:50,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:52,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:54,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:56,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 03:59:58,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:00,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:02,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:15,990 WARN L233 SmtUtils]: Spent 8.00s on a formula simplification. DAG size of input: 69 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:00:17,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:20,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:23,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:31,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:33,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:35,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:36,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:38,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:40,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:43,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:00:43,722 INFO L130 PetriNetUnfolder]: 4954/6960 cut-off events. [2022-11-23 04:00:43,722 INFO L131 PetriNetUnfolder]: For 40858/40858 co-relation queries the response was YES. [2022-11-23 04:00:43,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42223 conditions, 6960 events. 4954/6960 cut-off events. For 40858/40858 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 33049 event pairs, 484 based on Foata normal form. 36/6996 useless extension candidates. Maximal degree in co-relation 42182. Up to 5794 conditions per place. [2022-11-23 04:00:43,815 INFO L137 encePairwiseOnDemand]: 267/286 looper letters, 338 selfloop transitions, 71 changer transitions 45/454 dead transitions. [2022-11-23 04:00:43,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 454 transitions, 4929 flow [2022-11-23 04:00:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 04:00:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-23 04:00:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2143 transitions. [2022-11-23 04:00:43,825 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4162781662781663 [2022-11-23 04:00:43,825 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2143 transitions. [2022-11-23 04:00:43,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2143 transitions. [2022-11-23 04:00:43,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:00:43,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2143 transitions. [2022-11-23 04:00:43,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 119.05555555555556) internal successors, (2143), 18 states have internal predecessors, (2143), 0 states have call successors, (0), 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 04:00:43,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 286.0) internal successors, (5434), 19 states have internal predecessors, (5434), 0 states have call successors, (0), 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 04:00:43,843 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 286.0) internal successors, (5434), 19 states have internal predecessors, (5434), 0 states have call successors, (0), 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 04:00:43,844 INFO L175 Difference]: Start difference. First operand has 118 places, 215 transitions, 2343 flow. Second operand 18 states and 2143 transitions. [2022-11-23 04:00:43,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 454 transitions, 4929 flow [2022-11-23 04:00:44,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 454 transitions, 4552 flow, removed 186 selfloop flow, removed 1 redundant places. [2022-11-23 04:00:44,141 INFO L231 Difference]: Finished difference. Result has 145 places, 282 transitions, 2965 flow [2022-11-23 04:00:44,142 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2965, PETRI_PLACES=145, PETRI_TRANSITIONS=282} [2022-11-23 04:00:44,142 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 94 predicate places. [2022-11-23 04:00:44,142 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 282 transitions, 2965 flow [2022-11-23 04:00:44,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 110.0625) internal successors, (1761), 16 states have internal predecessors, (1761), 0 states have call successors, (0), 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 04:00:44,143 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:00:44,143 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, 1] [2022-11-23 04:00:44,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-23 04:00:44,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:44,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 04:00:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1962122142, now seen corresponding path program 2 times [2022-11-23 04:00:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:00:44,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785824391] [2022-11-23 04:00:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:00:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:00:45,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:00:45,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785824391] [2022-11-23 04:00:45,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785824391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:45,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370240953] [2022-11-23 04:00:45,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 04:00:45,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:45,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:00:45,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:00:45,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 04:00:45,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 04:00:45,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 04:00:45,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 04:00:45,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:00:54,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:00:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:00:58,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370240953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 04:00:58,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 04:00:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-23 04:00:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989768580] [2022-11-23 04:00:58,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 04:00:58,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 04:00:58,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:00:58,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 04:00:58,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=181, Unknown=4, NotChecked=0, Total=240 [2022-11-23 04:01:00,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:02,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:04,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:07,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:09,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:13,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:13,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 286 [2022-11-23 04:01:13,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 282 transitions, 2965 flow. Second operand has 16 states, 16 states have (on average 110.1875) internal successors, (1763), 16 states have internal predecessors, (1763), 0 states have call successors, (0), 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 04:01:13,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:01:13,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 286 [2022-11-23 04:01:13,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:01:34,362 WARN L233 SmtUtils]: Spent 19.35s on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 04:01:37,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:41,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 4) c_~x4~0)) (.cse15 (div c_~x3~0 4294967296))) (let ((.cse14 (* 1073741824 .cse15)) (.cse13 (div (+ .cse5 c_~x3~0) 4294967296)) (.cse12 (* 4294967296 (div c_~n~0 4294967296)))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse3 (+ c_~x3~0 .cse12)) (.cse4 (* 4 c_~x4~0)) (.cse1 (mod (div c_~x3~0 4) 4294967296)) (.cse2 (mod c_~x4~0 4294967296)) (.cse6 (mod c_~n~0 4294967296)) (.cse7 (* 4294967296 .cse15)) (.cse10 (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (.cse11 (<= (+ 1 .cse14) (+ (* 1073741824 .cse13) c_~x4~0)))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod c_~x3~0 4) 0) (= .cse1 .cse2) (<= .cse3 (+ .cse4 (* (div (+ .cse5 (- 2) c_~x3~0 c_~n~0) 4294967296) 4294967296))) (not (< (mod c_~x3~0 4294967296) .cse6)) (<= .cse3 (+ .cse7 .cse4 (* 4294967296 (div (+ .cse5 c_~n~0 4294967293) 4294967296)))) (< 0 .cse1) (or (< .cse2 .cse6) (let ((.cse9 (* (div c_~x4~0 4294967296) 4294967296)) (.cse8 (+ .cse7 c_~x4~0))) (and (< .cse8 (+ c_~x3~0 .cse9 1)) .cse10 (<= (+ c_~x3~0 .cse9) .cse8)))) .cse11 .cse10 (or (<= (+ c_~x3~0 1073741825 .cse12) (+ (* 3 c_~x4~0) (* .cse13 3221225472) c_~n~0 .cse14)) .cse11))))) is different from false [2022-11-23 04:01:43,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:46,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:50,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:52,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:54,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:01:59,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:01,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:03,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:10,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:13,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:15,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:21,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:26,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:29,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:32,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:34,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:37,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:39,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:40,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:42,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:44,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:46,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:02:47,155 INFO L130 PetriNetUnfolder]: 5531/7882 cut-off events. [2022-11-23 04:02:47,155 INFO L131 PetriNetUnfolder]: For 57123/57123 co-relation queries the response was YES. [2022-11-23 04:02:47,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52374 conditions, 7882 events. 5531/7882 cut-off events. For 57123/57123 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 39396 event pairs, 515 based on Foata normal form. 18/7900 useless extension candidates. Maximal degree in co-relation 52321. Up to 6205 conditions per place. [2022-11-23 04:02:47,270 INFO L137 encePairwiseOnDemand]: 268/286 looper letters, 352 selfloop transitions, 83 changer transitions 23/458 dead transitions. [2022-11-23 04:02:47,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 458 transitions, 5820 flow [2022-11-23 04:02:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 04:02:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 04:02:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1428 transitions. [2022-11-23 04:02:47,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4160839160839161 [2022-11-23 04:02:47,275 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1428 transitions. [2022-11-23 04:02:47,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1428 transitions. [2022-11-23 04:02:47,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 04:02:47,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1428 transitions. [2022-11-23 04:02:47,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.0) internal successors, (1428), 12 states have internal predecessors, (1428), 0 states have call successors, (0), 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 04:02:47,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 286.0) internal successors, (3718), 13 states have internal predecessors, (3718), 0 states have call successors, (0), 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 04:02:47,287 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 286.0) internal successors, (3718), 13 states have internal predecessors, (3718), 0 states have call successors, (0), 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 04:02:47,287 INFO L175 Difference]: Start difference. First operand has 145 places, 282 transitions, 2965 flow. Second operand 12 states and 1428 transitions. [2022-11-23 04:02:47,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 458 transitions, 5820 flow [2022-11-23 04:02:47,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 458 transitions, 5435 flow, removed 190 selfloop flow, removed 2 redundant places. [2022-11-23 04:02:47,676 INFO L231 Difference]: Finished difference. Result has 160 places, 341 transitions, 3791 flow [2022-11-23 04:02:47,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2708, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3791, PETRI_PLACES=160, PETRI_TRANSITIONS=341} [2022-11-23 04:02:47,677 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 109 predicate places. [2022-11-23 04:02:47,677 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 341 transitions, 3791 flow [2022-11-23 04:02:47,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 110.1875) internal successors, (1763), 16 states have internal predecessors, (1763), 0 states have call successors, (0), 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 04:02:47,678 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 04:02:47,678 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, 1] [2022-11-23 04:02:47,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 04:02:47,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 04:02:47,887 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-11-23 04:02:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:02:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash -580017008, now seen corresponding path program 3 times [2022-11-23 04:02:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:02:47,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618980574] [2022-11-23 04:02:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:02:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:02:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:02:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:02:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618980574] [2022-11-23 04:02:49,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618980574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:02:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467238618] [2022-11-23 04:02:49,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 04:02:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:02:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:02:49,475 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:02:49,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_938a6c93-0bcd-43b8-addd-6ad91ca9b918/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 04:02:55,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 04:02:55,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 04:02:55,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 04:02:55,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:03:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:03:38,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:03:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 04:03:54,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467238618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 04:03:54,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 04:03:54,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-11-23 04:03:54,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518762830] [2022-11-23 04:03:54,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 04:03:54,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 04:03:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:03:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 04:03:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=152, Unknown=13, NotChecked=0, Total=210 [2022-11-23 04:03:57,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:03:59,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:01,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:03,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:05,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:08,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:10,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:12,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-23 04:04:12,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 286 [2022-11-23 04:04:12,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 341 transitions, 3791 flow. Second operand has 15 states, 15 states have (on average 110.26666666666667) internal successors, (1654), 15 states have internal predecessors, (1654), 0 states have call successors, (0), 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 04:04:12,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 04:04:12,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 286 [2022-11-23 04:04:12,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 04:04:25,588 WARN L233 SmtUtils]: Spent 11.95s on a formula simplification. DAG size of input: 77 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)