./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/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_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --- 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:34:40,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:34:40,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:34:40,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:34:40,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:34:40,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:34:40,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:34:40,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:34:40,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:34:40,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:34:40,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:34:40,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:34:40,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:34:40,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:34:40,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:34:40,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:34:40,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:34:40,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:34:40,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:34:40,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:34:40,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:34:40,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:34:40,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:34:40,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:34:40,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:34:40,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:34:40,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:34:40,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:34:40,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:34:40,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:34:40,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:34:40,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:34:40,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:34:40,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:34:40,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:34:40,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:34:40,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:34:40,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:34:40,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:34:40,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:34:40,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:34:40,907 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:34:40,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:34:40,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:34:40,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:34:40,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:34:40,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:34:40,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:34:40,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:34:40,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:34:40,949 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:34:40,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:34:40,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:34:40,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:34:40,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:34:40,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:34:40,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:34:40,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:34:40,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:34:40,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:34:40,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:34:40,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:34:40,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:34:40,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:34:40,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:34:40,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:34:40,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:34:40,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:34:40,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:34:40,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:34:40,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:34:40,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:34:40,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:34:40,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:34:40,956 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:34:40,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:34:40,956 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_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/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_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/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 ! call(reach_error())) ) 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 -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db [2022-11-23 03:34:41,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:34:41,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:34:41,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:34:41,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:34:41,302 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:34:41,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix021.opt.i [2022-11-23 03:34:44,268 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:34:44,504 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:34:44,504 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/sv-benchmarks/c/pthread-wmm/mix021.opt.i [2022-11-23 03:34:44,525 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/data/38b25b006/b7c68ecd79d74090a08a76c1c08a3849/FLAGb93b544eb [2022-11-23 03:34:44,545 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/data/38b25b006/b7c68ecd79d74090a08a76c1c08a3849 [2022-11-23 03:34:44,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:34:44,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:34:44,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:34:44,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:34:44,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:34:44,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:44" (1/1) ... [2022-11-23 03:34:44,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198b6120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:44, skipping insertion in model container [2022-11-23 03:34:44,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:44" (1/1) ... [2022-11-23 03:34:44,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:34:44,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:34:44,775 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_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/sv-benchmarks/c/pthread-wmm/mix021.opt.i[944,957] [2022-11-23 03:34:45,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:34:45,059 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:34:45,074 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_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/sv-benchmarks/c/pthread-wmm/mix021.opt.i[944,957] [2022-11-23 03:34:45,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:34:45,214 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:34:45,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45 WrapperNode [2022-11-23 03:34:45,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:34:45,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:34:45,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:34:45,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:34:45,223 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:34:45" (1/1) ... [2022-11-23 03:34:45,261 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:34:45" (1/1) ... [2022-11-23 03:34:45,308 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2022-11-23 03:34:45,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:34:45,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:34:45,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:34:45,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:34:45,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:34:45,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:34:45,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:34:45,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:34:45,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (1/1) ... [2022-11-23 03:34:45,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:34:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:34:45,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:34:45,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:34:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:34:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:34:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:34:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:34:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:34:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:34:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:34:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:34:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:34:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:34:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:34:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 03:34:45,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 03:34:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:34:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:34:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:34:45,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:34:45,465 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:34:45,633 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:34:45,635 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:34:46,027 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:34:46,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:34:46,193 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:34:46,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:46 BoogieIcfgContainer [2022-11-23 03:34:46,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:34:46,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:34:46,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:34:46,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:34:46,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:34:44" (1/3) ... [2022-11-23 03:34:46,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35097eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:46, skipping insertion in model container [2022-11-23 03:34:46,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:45" (2/3) ... [2022-11-23 03:34:46,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35097eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:46, skipping insertion in model container [2022-11-23 03:34:46,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:46" (3/3) ... [2022-11-23 03:34:46,209 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2022-11-23 03:34:46,218 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:34:46,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:34:46,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 03:34:46,233 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:34:46,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:34:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-11-23 03:34:46,396 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-11-23 03:34:46,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:34:46,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-23 03:34:46,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-11-23 03:34:46,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-11-23 03:34:46,410 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:34:46,425 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-11-23 03:34:46,428 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-11-23 03:34:46,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-11-23 03:34:46,464 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-11-23 03:34:46,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:34:46,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-23 03:34:46,467 INFO L119 LiptonReduction]: Number of co-enabled transitions 2934 [2022-11-23 03:34:51,606 INFO L134 LiptonReduction]: Checked pairs total: 6909 [2022-11-23 03:34:51,606 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-23 03:34:51,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:34:51,628 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@781c867f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:34:51,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 03:34:51,635 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-11-23 03:34:51,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:34:51,635 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:34:51,636 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:34:51,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:34:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:34:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash 18015008, now seen corresponding path program 1 times [2022-11-23 03:34:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:34:51,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345268203] [2022-11-23 03:34:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:34:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:34:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:34:52,269 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:34:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:34:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345268203] [2022-11-23 03:34:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345268203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:34:52,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:34:52,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:34:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324526039] [2022-11-23 03:34:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:34:52,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:34:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:34:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:34:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:34:52,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 248 [2022-11-23 03:34:52,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:52,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:34:52,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 248 [2022-11-23 03:34:52,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:34:53,252 INFO L130 PetriNetUnfolder]: 3113/4510 cut-off events. [2022-11-23 03:34:53,253 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-23 03:34:53,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 4510 events. 3113/4510 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23607 event pairs, 593 based on Foata normal form. 0/4326 useless extension candidates. Maximal degree in co-relation 8892. Up to 3385 conditions per place. [2022-11-23 03:34:53,288 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2022-11-23 03:34:53,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2022-11-23 03:34:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:34:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:34:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2022-11-23 03:34:53,310 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5362903225806451 [2022-11-23 03:34:53,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2022-11-23 03:34:53,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2022-11-23 03:34:53,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:34:53,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2022-11-23 03:34:53,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:53,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:53,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:53,339 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 399 transitions. [2022-11-23 03:34:53,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2022-11-23 03:34:53,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 03:34:53,347 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-23 03:34:53,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-23 03:34:53,353 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-23 03:34:53,353 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-23 03:34:53,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:53,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:34:53,355 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:34:53,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:34:53,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:34:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:34:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash -183942603, now seen corresponding path program 1 times [2022-11-23 03:34:53,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:34:53,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787232058] [2022-11-23 03:34:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:34:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:34:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:34:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:34:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:34:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787232058] [2022-11-23 03:34:53,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787232058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:34:53,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:34:53,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:34:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863309326] [2022-11-23 03:34:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:34:53,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:34:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:34:53,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:34:53,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:34:53,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-11-23 03:34:53,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:53,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:34:53,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-11-23 03:34:53,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:34:55,924 INFO L130 PetriNetUnfolder]: 10895/15040 cut-off events. [2022-11-23 03:34:55,925 INFO L131 PetriNetUnfolder]: For 554/554 co-relation queries the response was YES. [2022-11-23 03:34:55,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30938 conditions, 15040 events. 10895/15040 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 79054 event pairs, 3371 based on Foata normal form. 652/15692 useless extension candidates. Maximal degree in co-relation 30928. Up to 7839 conditions per place. [2022-11-23 03:34:56,024 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 39 selfloop transitions, 8 changer transitions 29/76 dead transitions. [2022-11-23 03:34:56,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2022-11-23 03:34:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:34:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:34:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-11-23 03:34:56,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5064516129032258 [2022-11-23 03:34:56,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2022-11-23 03:34:56,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2022-11-23 03:34:56,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:34:56,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2022-11-23 03:34:56,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:56,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:56,034 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:56,034 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 628 transitions. [2022-11-23 03:34:56,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2022-11-23 03:34:56,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:34:56,052 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 140 flow [2022-11-23 03:34:56,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-23 03:34:56,053 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-23 03:34:56,053 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 140 flow [2022-11-23 03:34:56,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:56,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:34:56,054 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:34:56,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:34:56,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:34:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:34:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1407278359, now seen corresponding path program 1 times [2022-11-23 03:34:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:34:56,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252554042] [2022-11-23 03:34:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:34:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:34:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:34:56,233 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:34:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:34:56,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252554042] [2022-11-23 03:34:56,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252554042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:34:56,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:34:56,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:34:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224538467] [2022-11-23 03:34:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:34:56,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:34:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:34:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:34:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:34:56,261 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-11-23 03:34:56,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:56,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:34:56,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-11-23 03:34:56,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:34:58,278 INFO L130 PetriNetUnfolder]: 9487/13208 cut-off events. [2022-11-23 03:34:58,278 INFO L131 PetriNetUnfolder]: For 11664/11664 co-relation queries the response was YES. [2022-11-23 03:34:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38414 conditions, 13208 events. 9487/13208 cut-off events. For 11664/11664 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 67612 event pairs, 1943 based on Foata normal form. 620/13828 useless extension candidates. Maximal degree in co-relation 38400. Up to 5411 conditions per place. [2022-11-23 03:34:58,366 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 49 selfloop transitions, 9 changer transitions 42/100 dead transitions. [2022-11-23 03:34:58,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 100 transitions, 616 flow [2022-11-23 03:34:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:34:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:34:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-11-23 03:34:58,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4959677419354839 [2022-11-23 03:34:58,370 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2022-11-23 03:34:58,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2022-11-23 03:34:58,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:34:58,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2022-11-23 03:34:58,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:58,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:58,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:58,378 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 140 flow. Second operand 7 states and 861 transitions. [2022-11-23 03:34:58,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 100 transitions, 616 flow [2022-11-23 03:34:58,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 100 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:34:58,404 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 208 flow [2022-11-23 03:34:58,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-11-23 03:34:58,405 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-11-23 03:34:58,405 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 208 flow [2022-11-23 03:34:58,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:58,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:34:58,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:34:58,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:34:58,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:34:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:34:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -557207297, now seen corresponding path program 1 times [2022-11-23 03:34:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:34:58,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709084680] [2022-11-23 03:34:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:34:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:34:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:34:58,788 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:34:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:34:58,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709084680] [2022-11-23 03:34:58,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709084680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:34:58,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:34:58,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:34:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403368037] [2022-11-23 03:34:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:34:58,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:34:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:34:58,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:34:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:34:58,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 248 [2022-11-23 03:34:58,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:34:58,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:34:58,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 248 [2022-11-23 03:34:58,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:00,669 INFO L130 PetriNetUnfolder]: 7510/10764 cut-off events. [2022-11-23 03:35:00,669 INFO L131 PetriNetUnfolder]: For 22898/23165 co-relation queries the response was YES. [2022-11-23 03:35:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34056 conditions, 10764 events. 7510/10764 cut-off events. For 22898/23165 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 59844 event pairs, 2054 based on Foata normal form. 598/11198 useless extension candidates. Maximal degree in co-relation 34036. Up to 8381 conditions per place. [2022-11-23 03:35:00,748 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 48 selfloop transitions, 7 changer transitions 25/85 dead transitions. [2022-11-23 03:35:00,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 602 flow [2022-11-23 03:35:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:35:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:35:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2022-11-23 03:35:00,751 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5193548387096775 [2022-11-23 03:35:00,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2022-11-23 03:35:00,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2022-11-23 03:35:00,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:00,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2022-11-23 03:35:00,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:00,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:00,761 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:00,761 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 208 flow. Second operand 5 states and 644 transitions. [2022-11-23 03:35:00,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 602 flow [2022-11-23 03:35:00,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 591 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 03:35:00,832 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 290 flow [2022-11-23 03:35:00,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-11-23 03:35:00,833 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-11-23 03:35:00,833 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 290 flow [2022-11-23 03:35:00,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:00,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:00,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:00,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:35:00,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash -92303855, now seen corresponding path program 1 times [2022-11-23 03:35:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:00,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668019026] [2022-11-23 03:35:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:01,089 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:35:01,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:01,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668019026] [2022-11-23 03:35:01,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668019026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:01,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:01,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:35:01,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690513871] [2022-11-23 03:35:01,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:01,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:35:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:01,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:35:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:35:01,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-11-23 03:35:01,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:01,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:01,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-11-23 03:35:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:02,699 INFO L130 PetriNetUnfolder]: 8098/11301 cut-off events. [2022-11-23 03:35:02,699 INFO L131 PetriNetUnfolder]: For 22190/22190 co-relation queries the response was YES. [2022-11-23 03:35:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38355 conditions, 11301 events. 8098/11301 cut-off events. For 22190/22190 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 57709 event pairs, 1419 based on Foata normal form. 326/11627 useless extension candidates. Maximal degree in co-relation 38332. Up to 5869 conditions per place. [2022-11-23 03:35:02,812 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 60 selfloop transitions, 22 changer transitions 31/113 dead transitions. [2022-11-23 03:35:02,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 113 transitions, 816 flow [2022-11-23 03:35:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:35:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:35:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2022-11-23 03:35:02,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011520737327189 [2022-11-23 03:35:02,816 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2022-11-23 03:35:02,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2022-11-23 03:35:02,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:02,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2022-11-23 03:35:02,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:02,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:02,824 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:02,824 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 290 flow. Second operand 7 states and 870 transitions. [2022-11-23 03:35:02,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 113 transitions, 816 flow [2022-11-23 03:35:02,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 113 transitions, 783 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-23 03:35:02,954 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 401 flow [2022-11-23 03:35:02,954 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2022-11-23 03:35:02,955 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2022-11-23 03:35:02,955 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 401 flow [2022-11-23 03:35:02,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:02,956 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:02,956 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:02,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:35:02,956 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1451543501, now seen corresponding path program 1 times [2022-11-23 03:35:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:02,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685179300] [2022-11-23 03:35:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:03,206 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:35:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:03,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685179300] [2022-11-23 03:35:03,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685179300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:03,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:03,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:35:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485403569] [2022-11-23 03:35:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:03,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:35:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:35:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:35:03,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-11-23 03:35:03,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 401 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:03,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:03,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-11-23 03:35:03,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:04,984 INFO L130 PetriNetUnfolder]: 9913/13958 cut-off events. [2022-11-23 03:35:04,984 INFO L131 PetriNetUnfolder]: For 43623/43623 co-relation queries the response was YES. [2022-11-23 03:35:05,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50144 conditions, 13958 events. 9913/13958 cut-off events. For 43623/43623 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 75012 event pairs, 1761 based on Foata normal form. 336/14294 useless extension candidates. Maximal degree in co-relation 50118. Up to 5508 conditions per place. [2022-11-23 03:35:05,215 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 60 selfloop transitions, 24 changer transitions 34/118 dead transitions. [2022-11-23 03:35:05,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 966 flow [2022-11-23 03:35:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:35:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:35:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-11-23 03:35:05,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4988479262672811 [2022-11-23 03:35:05,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2022-11-23 03:35:05,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2022-11-23 03:35:05,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:05,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2022-11-23 03:35:05,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:05,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:05,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:05,227 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 401 flow. Second operand 7 states and 866 transitions. [2022-11-23 03:35:05,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 966 flow [2022-11-23 03:35:05,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 118 transitions, 936 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-11-23 03:35:05,520 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 537 flow [2022-11-23 03:35:05,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=537, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-11-23 03:35:05,523 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2022-11-23 03:35:05,524 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 537 flow [2022-11-23 03:35:05,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:05,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:05,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:05,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:35:05,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1453271379, now seen corresponding path program 1 times [2022-11-23 03:35:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:05,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513721957] [2022-11-23 03:35:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:05,791 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:35:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:05,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513721957] [2022-11-23 03:35:05,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513721957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:05,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:05,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:35:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80291162] [2022-11-23 03:35:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:05,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:35:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:35:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:35:05,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 248 [2022-11-23 03:35:05,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:05,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:05,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 248 [2022-11-23 03:35:05,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:06,838 INFO L130 PetriNetUnfolder]: 4673/6992 cut-off events. [2022-11-23 03:35:06,838 INFO L131 PetriNetUnfolder]: For 29226/30053 co-relation queries the response was YES. [2022-11-23 03:35:06,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25856 conditions, 6992 events. 4673/6992 cut-off events. For 29226/30053 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 40209 event pairs, 1215 based on Foata normal form. 423/7215 useless extension candidates. Maximal degree in co-relation 25825. Up to 6152 conditions per place. [2022-11-23 03:35:06,897 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 64 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2022-11-23 03:35:06,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 84 transitions, 920 flow [2022-11-23 03:35:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:35:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:35:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-11-23 03:35:06,900 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5228494623655914 [2022-11-23 03:35:06,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-11-23 03:35:06,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-11-23 03:35:06,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:06,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-11-23 03:35:06,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:06,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:06,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:06,905 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 537 flow. Second operand 3 states and 389 transitions. [2022-11-23 03:35:06,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 84 transitions, 920 flow [2022-11-23 03:35:06,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 904 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-11-23 03:35:06,946 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 560 flow [2022-11-23 03:35:06,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2022-11-23 03:35:06,947 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2022-11-23 03:35:06,947 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 560 flow [2022-11-23 03:35:06,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:06,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:06,948 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:06,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:35:06,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -303235579, now seen corresponding path program 1 times [2022-11-23 03:35:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:06,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178347924] [2022-11-23 03:35:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:07,178 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:35:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:07,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178347924] [2022-11-23 03:35:07,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178347924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:07,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:07,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:35:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431940517] [2022-11-23 03:35:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:35:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:35:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:35:07,209 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-11-23 03:35:07,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 560 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:07,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:07,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-11-23 03:35:07,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:08,718 INFO L130 PetriNetUnfolder]: 7749/11554 cut-off events. [2022-11-23 03:35:08,718 INFO L131 PetriNetUnfolder]: For 53407/53407 co-relation queries the response was YES. [2022-11-23 03:35:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49201 conditions, 11554 events. 7749/11554 cut-off events. For 53407/53407 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66953 event pairs, 2063 based on Foata normal form. 228/11782 useless extension candidates. Maximal degree in co-relation 49168. Up to 5180 conditions per place. [2022-11-23 03:35:08,788 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 77 selfloop transitions, 21 changer transitions 36/134 dead transitions. [2022-11-23 03:35:08,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 134 transitions, 1317 flow [2022-11-23 03:35:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:35:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:35:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2022-11-23 03:35:08,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49827188940092165 [2022-11-23 03:35:08,794 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2022-11-23 03:35:08,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2022-11-23 03:35:08,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:08,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2022-11-23 03:35:08,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:08,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:08,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:08,802 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 560 flow. Second operand 7 states and 865 transitions. [2022-11-23 03:35:08,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 134 transitions, 1317 flow [2022-11-23 03:35:08,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 134 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:35:08,890 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 685 flow [2022-11-23 03:35:08,890 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=685, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2022-11-23 03:35:08,893 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2022-11-23 03:35:08,893 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 685 flow [2022-11-23 03:35:08,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:08,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:08,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:08,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:35:08,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash -928099510, now seen corresponding path program 1 times [2022-11-23 03:35:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:08,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47976676] [2022-11-23 03:35:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:09,106 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:35:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:09,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47976676] [2022-11-23 03:35:09,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47976676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:09,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:09,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:35:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063438632] [2022-11-23 03:35:09,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:09,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:35:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:09,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:35:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:35:09,123 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 248 [2022-11-23 03:35:09,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 685 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:09,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:09,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 248 [2022-11-23 03:35:09,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:09,861 INFO L130 PetriNetUnfolder]: 2669/4366 cut-off events. [2022-11-23 03:35:09,862 INFO L131 PetriNetUnfolder]: For 22224/22620 co-relation queries the response was YES. [2022-11-23 03:35:09,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18055 conditions, 4366 events. 2669/4366 cut-off events. For 22224/22620 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26330 event pairs, 442 based on Foata normal form. 452/4718 useless extension candidates. Maximal degree in co-relation 18015. Up to 2775 conditions per place. [2022-11-23 03:35:09,906 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 89 selfloop transitions, 9 changer transitions 0/113 dead transitions. [2022-11-23 03:35:09,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 1419 flow [2022-11-23 03:35:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:35:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:35:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2022-11-23 03:35:09,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2022-11-23 03:35:09,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2022-11-23 03:35:09,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2022-11-23 03:35:09,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:09,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2022-11-23 03:35:09,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:09,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:09,915 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:09,915 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 685 flow. Second operand 4 states and 520 transitions. [2022-11-23 03:35:09,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 1419 flow [2022-11-23 03:35:09,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 1391 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-11-23 03:35:09,950 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 717 flow [2022-11-23 03:35:09,950 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2022-11-23 03:35:09,951 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2022-11-23 03:35:09,951 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 717 flow [2022-11-23 03:35:09,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:09,952 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:09,952 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:09,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:35:09,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2015927585, now seen corresponding path program 1 times [2022-11-23 03:35:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:09,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3721020] [2022-11-23 03:35:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:10,271 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:35:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:10,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3721020] [2022-11-23 03:35:10,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3721020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:10,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:10,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:35:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81194635] [2022-11-23 03:35:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:10,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:35:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:35:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:35:10,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 248 [2022-11-23 03:35:10,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 717 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:10,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:10,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 248 [2022-11-23 03:35:10,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:10,853 INFO L130 PetriNetUnfolder]: 1679/2798 cut-off events. [2022-11-23 03:35:10,853 INFO L131 PetriNetUnfolder]: For 14463/14849 co-relation queries the response was YES. [2022-11-23 03:35:10,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13321 conditions, 2798 events. 1679/2798 cut-off events. For 14463/14849 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 15985 event pairs, 198 based on Foata normal form. 404/3130 useless extension candidates. Maximal degree in co-relation 13281. Up to 1158 conditions per place. [2022-11-23 03:35:10,868 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 96 selfloop transitions, 13 changer transitions 9/131 dead transitions. [2022-11-23 03:35:10,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 131 transitions, 1623 flow [2022-11-23 03:35:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:35:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:35:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2022-11-23 03:35:10,871 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5233870967741936 [2022-11-23 03:35:10,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2022-11-23 03:35:10,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2022-11-23 03:35:10,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:10,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2022-11-23 03:35:10,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:10,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:10,876 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:10,877 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 717 flow. Second operand 5 states and 649 transitions. [2022-11-23 03:35:10,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 131 transitions, 1623 flow [2022-11-23 03:35:10,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 131 transitions, 1597 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-23 03:35:10,896 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 709 flow [2022-11-23 03:35:10,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=709, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2022-11-23 03:35:10,897 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2022-11-23 03:35:10,897 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 709 flow [2022-11-23 03:35:10,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:10,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:10,898 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:35:10,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:35:10,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash 46380739, now seen corresponding path program 1 times [2022-11-23 03:35:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:10,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832915669] [2022-11-23 03:35:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:11,130 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:35:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:11,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832915669] [2022-11-23 03:35:11,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832915669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:11,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:11,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:35:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895016625] [2022-11-23 03:35:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:11,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:35:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:11,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:35:11,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:35:11,142 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 248 [2022-11-23 03:35:11,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:11,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:11,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 248 [2022-11-23 03:35:11,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:11,653 INFO L130 PetriNetUnfolder]: 1513/2471 cut-off events. [2022-11-23 03:35:11,653 INFO L131 PetriNetUnfolder]: For 13687/14056 co-relation queries the response was YES. [2022-11-23 03:35:11,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12173 conditions, 2471 events. 1513/2471 cut-off events. For 13687/14056 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 13806 event pairs, 177 based on Foata normal form. 259/2660 useless extension candidates. Maximal degree in co-relation 12133. Up to 912 conditions per place. [2022-11-23 03:35:11,667 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 66 selfloop transitions, 17 changer transitions 35/125 dead transitions. [2022-11-23 03:35:11,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 125 transitions, 1532 flow [2022-11-23 03:35:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:35:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:35:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2022-11-23 03:35:11,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5141129032258065 [2022-11-23 03:35:11,671 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2022-11-23 03:35:11,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2022-11-23 03:35:11,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:11,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2022-11-23 03:35:11,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:11,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:11,677 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:11,677 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 709 flow. Second operand 6 states and 765 transitions. [2022-11-23 03:35:11,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 125 transitions, 1532 flow [2022-11-23 03:35:11,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 1374 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-11-23 03:35:11,733 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 442 flow [2022-11-23 03:35:11,733 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2022-11-23 03:35:11,734 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2022-11-23 03:35:11,734 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 442 flow [2022-11-23 03:35:11,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:11,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:11,735 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, 1, 1, 1] [2022-11-23 03:35:11,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:35:11,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash -793519477, now seen corresponding path program 1 times [2022-11-23 03:35:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:11,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591958828] [2022-11-23 03:35:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:11,976 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:35:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:11,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591958828] [2022-11-23 03:35:11,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591958828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:11,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:11,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:35:11,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215946497] [2022-11-23 03:35:11,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:11,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:35:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:11,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:35:11,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:35:11,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 248 [2022-11-23 03:35:11,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:11,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:11,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 248 [2022-11-23 03:35:11,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:12,220 INFO L130 PetriNetUnfolder]: 377/669 cut-off events. [2022-11-23 03:35:12,221 INFO L131 PetriNetUnfolder]: For 3032/3042 co-relation queries the response was YES. [2022-11-23 03:35:12,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 669 events. 377/669 cut-off events. For 3032/3042 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2641 event pairs, 73 based on Foata normal form. 11/676 useless extension candidates. Maximal degree in co-relation 3420. Up to 418 conditions per place. [2022-11-23 03:35:12,224 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 37 selfloop transitions, 1 changer transitions 45/85 dead transitions. [2022-11-23 03:35:12,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 85 transitions, 871 flow [2022-11-23 03:35:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:35:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:35:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-11-23 03:35:12,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5056451612903226 [2022-11-23 03:35:12,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2022-11-23 03:35:12,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2022-11-23 03:35:12,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:12,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2022-11-23 03:35:12,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:12,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:12,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:12,232 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 442 flow. Second operand 5 states and 627 transitions. [2022-11-23 03:35:12,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 85 transitions, 871 flow [2022-11-23 03:35:12,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 675 flow, removed 39 selfloop flow, removed 14 redundant places. [2022-11-23 03:35:12,243 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 227 flow [2022-11-23 03:35:12,244 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2022-11-23 03:35:12,244 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2022-11-23 03:35:12,245 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 227 flow [2022-11-23 03:35:12,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:12,245 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:12,245 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, 1, 1, 1] [2022-11-23 03:35:12,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:35:12,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1010296071, now seen corresponding path program 2 times [2022-11-23 03:35:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:12,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766850325] [2022-11-23 03:35:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:14,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766850325] [2022-11-23 03:35:14,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766850325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:14,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:14,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:35:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023444870] [2022-11-23 03:35:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:14,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:35:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:35:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:35:14,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2022-11-23 03:35:14,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 227 flow. Second operand has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:14,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:35:14,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2022-11-23 03:35:14,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:35:14,473 INFO L130 PetriNetUnfolder]: 116/238 cut-off events. [2022-11-23 03:35:14,473 INFO L131 PetriNetUnfolder]: For 579/579 co-relation queries the response was YES. [2022-11-23 03:35:14,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 238 events. 116/238 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 734 event pairs, 18 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 981. Up to 77 conditions per place. [2022-11-23 03:35:14,474 INFO L137 encePairwiseOnDemand]: 240/248 looper letters, 35 selfloop transitions, 4 changer transitions 35/77 dead transitions. [2022-11-23 03:35:14,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 605 flow [2022-11-23 03:35:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:35:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:35:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1060 transitions. [2022-11-23 03:35:14,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47491039426523296 [2022-11-23 03:35:14,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1060 transitions. [2022-11-23 03:35:14,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1060 transitions. [2022-11-23 03:35:14,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:35:14,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1060 transitions. [2022-11-23 03:35:14,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.77777777777777) internal successors, (1060), 9 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:14,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:14,485 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:14,486 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 227 flow. Second operand 9 states and 1060 transitions. [2022-11-23 03:35:14,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 605 flow [2022-11-23 03:35:14,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 512 flow, removed 6 selfloop flow, removed 16 redundant places. [2022-11-23 03:35:14,489 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 180 flow [2022-11-23 03:35:14,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2022-11-23 03:35:14,490 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2022-11-23 03:35:14,490 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 180 flow [2022-11-23 03:35:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:14,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:35:14,491 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, 1, 1, 1] [2022-11-23 03:35:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:35:14,491 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 03:35:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 881110055, now seen corresponding path program 3 times [2022-11-23 03:35:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:14,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569013291] [2022-11-23 03:35:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:35:14,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:35:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:35:14,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:35:14,642 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:35:14,644 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 03:35:14,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 03:35:14,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 03:35:14,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 03:35:14,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 03:35:14,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 03:35:14,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 03:35:14,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:35:14,651 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:14,658 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:35:14,659 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:35:14,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:35:14 BasicIcfg [2022-11-23 03:35:14,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:35:14,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:35:14,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:35:14,762 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:35:14,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:46" (3/4) ... [2022-11-23 03:35:14,764 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:35:14,876 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:35:14,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:35:14,877 INFO L158 Benchmark]: Toolchain (without parser) took 30324.72ms. Allocated memory was 144.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 99.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-23 03:35:14,877 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 98.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:35:14,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.20ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 75.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 03:35:14,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.57ms. Allocated memory is still 144.7MB. Free memory was 74.6MB in the beginning and 71.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 03:35:14,878 INFO L158 Benchmark]: Boogie Preprocessor took 60.31ms. Allocated memory is still 144.7MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:35:14,878 INFO L158 Benchmark]: RCFGBuilder took 826.42ms. Allocated memory is still 144.7MB. Free memory was 69.7MB in the beginning and 87.2MB in the end (delta: -17.5MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-11-23 03:35:14,879 INFO L158 Benchmark]: TraceAbstraction took 28563.11ms. Allocated memory was 144.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 86.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 997.1MB. Max. memory is 16.1GB. [2022-11-23 03:35:14,879 INFO L158 Benchmark]: Witness Printer took 114.44ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 03:35:14,883 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 98.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.20ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 75.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.57ms. Allocated memory is still 144.7MB. Free memory was 74.6MB in the beginning and 71.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.31ms. Allocated memory is still 144.7MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 826.42ms. Allocated memory is still 144.7MB. Free memory was 69.7MB in the beginning and 87.2MB in the end (delta: -17.5MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28563.11ms. Allocated memory was 144.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 86.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 997.1MB. Max. memory is 16.1GB. * Witness Printer took 114.44ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 141 PlacesBefore, 41 PlacesAfterwards, 130 TransitionsBefore, 29 TransitionsAfterwards, 2934 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 6909 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3966, independent: 3783, independent conditional: 0, independent unconditional: 3783, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2161, independent: 2115, independent conditional: 0, independent unconditional: 2115, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2161, independent: 2080, independent conditional: 0, independent unconditional: 2080, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 374, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3966, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 2161, unknown conditional: 0, unknown unconditional: 2161] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 216, Positive conditional cache size: 0, Positive unconditional cache size: 216, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L862] 0 pthread_t t557; [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t557, ((void *)0), P0, ((void *)0))=-3, t557={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t558; [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t558, ((void *)0), P1, ((void *)0))=-2, t557={5:0}, t558={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t559; [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t559, ((void *)0), P2, ((void *)0))=-1, t557={5:0}, t558={6:0}, t559={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t560; [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t560, ((void *)0), P3, ((void *)0))=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557={5:0}, t558={6:0}, t559={7:0}, t560={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 742 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 602 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1650 IncrementalHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 78 mSDtfsCounter, 1650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=9, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 03:35:14,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf0b7644-a063-4afe-bccb-46f8cb01d9cb/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE