./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8 --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 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --- 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-e04fb08 [2022-11-16 12:10:50,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:10:50,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:10:50,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:10:50,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:10:50,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:10:50,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:10:50,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:10:50,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:10:50,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:10:50,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:10:50,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:10:50,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:10:50,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:10:50,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:10:50,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:10:50,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:10:50,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:10:50,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:10:50,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:10:50,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:10:50,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:10:50,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:10:50,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:10:50,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:10:50,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:10:50,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:10:50,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:10:50,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:10:50,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:10:50,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:10:50,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:10:50,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:10:50,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:10:50,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:10:50,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:10:50,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:10:50,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:10:50,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:10:50,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:10:50,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:10:50,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:10:50,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:10:50,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:10:50,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:10:50,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:10:50,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:10:50,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:10:50,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:10:50,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:10:50,953 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:10:50,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:10:50,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:10:50,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:10:50,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:10:50,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:10:50,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:10:50,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:10:50,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:10:50,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:10:50,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:10:50,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:10:50,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:10:50,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:10:50,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:10:50,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:10:50,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:10:50,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:10:50,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:10:50,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:10:50,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:10:50,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:10:50,974 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:10:50,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:10:50,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:10:50,975 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/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_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8 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 -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc [2022-11-16 12:10:51,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:10:51,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:10:51,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:10:51,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:10:51,413 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:10:51,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-16 12:10:51,500 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/data/38c13d956/81a87ee50c834f3b9873eb04b62ff7f4/FLAG776b9ba48 [2022-11-16 12:10:52,139 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:10:52,139 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-16 12:10:52,160 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/data/38c13d956/81a87ee50c834f3b9873eb04b62ff7f4/FLAG776b9ba48 [2022-11-16 12:10:52,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/data/38c13d956/81a87ee50c834f3b9873eb04b62ff7f4 [2022-11-16 12:10:52,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:10:52,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:10:52,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:10:52,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:10:52,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:10:52,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:52" (1/1) ... [2022-11-16 12:10:52,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42adcd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:52, skipping insertion in model container [2022-11-16 12:10:52,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:52" (1/1) ... [2022-11-16 12:10:52,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:10:52,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:10:53,188 WARN L229 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_c78b8580-eced-44f8-b498-b4d4acb7929e/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-16 12:10:53,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:10:53,264 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:10:53,325 WARN L229 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_c78b8580-eced-44f8-b498-b4d4acb7929e/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-16 12:10:53,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:10:53,440 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:10:53,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53 WrapperNode [2022-11-16 12:10:53,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:10:53,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:10:53,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:10:53,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:10:53,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,520 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 201 [2022-11-16 12:10:53,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:10:53,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:10:53,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:10:53,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:10:53,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,555 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:10:53,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:10:53,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:10:53,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:10:53,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (1/1) ... [2022-11-16 12:10:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:10:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:10:53,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:10:53,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:10:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:10:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:10:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:10:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:10:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 12:10:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:10:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 12:10:53,679 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 12:10:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:10:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:10:53,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:10:53,682 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:10:53,914 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:10:53,916 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:10:54,436 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:10:54,444 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:10:54,451 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-16 12:10:54,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:54 BoogieIcfgContainer [2022-11-16 12:10:54,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:10:54,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:10:54,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:10:54,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:10:54,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:10:52" (1/3) ... [2022-11-16 12:10:54,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ad19df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:10:54, skipping insertion in model container [2022-11-16 12:10:54,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:53" (2/3) ... [2022-11-16 12:10:54,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ad19df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:10:54, skipping insertion in model container [2022-11-16 12:10:54,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:10:54" (3/3) ... [2022-11-16 12:10:54,470 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2022-11-16 12:10:54,486 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:10:54,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:10:54,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:10:54,500 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:10:54,659 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 12:10:54,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 206 transitions, 420 flow [2022-11-16 12:10:54,904 INFO L130 PetriNetUnfolder]: 43/278 cut-off events. [2022-11-16 12:10:54,910 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:10:54,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 278 events. 43/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 860 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2022-11-16 12:10:54,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 206 transitions, 420 flow [2022-11-16 12:10:54,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 199 transitions, 403 flow [2022-11-16 12:10:54,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:10:54,972 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;@6c02a917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:10:54,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 12:10:55,030 INFO L130 PetriNetUnfolder]: 14/162 cut-off events. [2022-11-16 12:10:55,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:10:55,031 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:10:55,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:10:55,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:10:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:10:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1080089369, now seen corresponding path program 1 times [2022-11-16 12:10:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:10:55,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470492827] [2022-11-16 12:10:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:10:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:10:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:10:55,401 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-16 12:10:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:10:55,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470492827] [2022-11-16 12:10:55,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470492827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:10:55,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:10:55,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:10:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891655639] [2022-11-16 12:10:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:10:55,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:10:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:10:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:10:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:10:55,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 206 [2022-11-16 12:10:55,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 199 transitions, 403 flow. Second operand has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:10:55,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 206 [2022-11-16 12:10:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:10:55,541 INFO L130 PetriNetUnfolder]: 4/231 cut-off events. [2022-11-16 12:10:55,542 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:10:55,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 231 events. 4/231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 37/257 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2022-11-16 12:10:55,546 INFO L137 encePairwiseOnDemand]: 182/206 looper letters, 1 selfloop transitions, 0 changer transitions 0/173 dead transitions. [2022-11-16 12:10:55,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 353 flow [2022-11-16 12:10:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:10:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:10:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 381 transitions. [2022-11-16 12:10:55,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9247572815533981 [2022-11-16 12:10:55,573 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 381 transitions. [2022-11-16 12:10:55,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 381 transitions. [2022-11-16 12:10:55,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:10:55,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 381 transitions. [2022-11-16 12:10:55,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 190.5) internal successors, (381), 2 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,603 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,605 INFO L175 Difference]: Start difference. First operand has 175 places, 199 transitions, 403 flow. Second operand 2 states and 381 transitions. [2022-11-16 12:10:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 353 flow [2022-11-16 12:10:55,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:10:55,617 INFO L231 Difference]: Finished difference. Result has 174 places, 173 transitions, 351 flow [2022-11-16 12:10:55,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=351, PETRI_PLACES=174, PETRI_TRANSITIONS=173} [2022-11-16 12:10:55,627 INFO L288 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2022-11-16 12:10:55,627 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 173 transitions, 351 flow [2022-11-16 12:10:55,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:10:55,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:10:55,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:10:55,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:10:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:10:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash 427462440, now seen corresponding path program 1 times [2022-11-16 12:10:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:10:55,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173848861] [2022-11-16 12:10:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:10:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:10:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:10:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:10:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:10:55,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173848861] [2022-11-16 12:10:55,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173848861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:10:55,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:10:55,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:10:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902198290] [2022-11-16 12:10:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:10:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:10:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:10:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:10:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:10:55,807 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2022-11-16 12:10:55,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 173 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:10:55,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2022-11-16 12:10:55,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:10:55,862 INFO L130 PetriNetUnfolder]: 3/177 cut-off events. [2022-11-16 12:10:55,863 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:10:55,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 177 events. 3/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 295 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 190. Up to 6 conditions per place. [2022-11-16 12:10:55,865 INFO L137 encePairwiseOnDemand]: 203/206 looper letters, 8 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-16 12:10:55,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 175 transitions, 375 flow [2022-11-16 12:10:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:10:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:10:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-11-16 12:10:55,868 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478964401294499 [2022-11-16 12:10:55,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-11-16 12:10:55,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-11-16 12:10:55,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:10:55,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-11-16 12:10:55,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,875 INFO L175 Difference]: Start difference. First operand has 174 places, 173 transitions, 351 flow. Second operand 3 states and 524 transitions. [2022-11-16 12:10:55,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 175 transitions, 375 flow [2022-11-16 12:10:55,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 175 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:10:55,904 INFO L231 Difference]: Finished difference. Result has 177 places, 173 transitions, 359 flow [2022-11-16 12:10:55,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2022-11-16 12:10:55,905 INFO L288 CegarLoopForPetriNet]: 175 programPoint places, 2 predicate places. [2022-11-16 12:10:55,905 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 359 flow [2022-11-16 12:10:55,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:55,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:10:55,906 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:10:55,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:10:55,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:10:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:10:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1004301748, now seen corresponding path program 1 times [2022-11-16 12:10:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:10:55,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3119278] [2022-11-16 12:10:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:10:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:10:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:10:55,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:10:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:10:56,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:10:56,078 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:10:56,079 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-16 12:10:56,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-16 12:10:56,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-16 12:10:56,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-16 12:10:56,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:10:56,084 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-16 12:10:56,087 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:10:56,088 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 12:10:56,146 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:10:56,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 266 transitions, 550 flow [2022-11-16 12:10:56,230 INFO L130 PetriNetUnfolder]: 72/435 cut-off events. [2022-11-16 12:10:56,230 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:10:56,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 435 events. 72/435 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1664 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 280. Up to 12 conditions per place. [2022-11-16 12:10:56,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 266 transitions, 550 flow [2022-11-16 12:10:56,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 264 transitions, 546 flow [2022-11-16 12:10:56,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:10:56,244 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;@6c02a917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:10:56,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 12:10:56,268 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-16 12:10:56,269 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:10:56,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:10:56,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:10:56,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 12:10:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:10:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1900868071, now seen corresponding path program 1 times [2022-11-16 12:10:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:10:56,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366183389] [2022-11-16 12:10:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:10:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:10:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:10:56,384 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-16 12:10:56,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:10:56,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366183389] [2022-11-16 12:10:56,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366183389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:10:56,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:10:56,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:10:56,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403287798] [2022-11-16 12:10:56,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:10:56,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:10:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:10:56,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:10:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:10:56,389 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 266 [2022-11-16 12:10:56,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 264 transitions, 546 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:10:56,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 266 [2022-11-16 12:10:56,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:10:56,513 INFO L130 PetriNetUnfolder]: 9/366 cut-off events. [2022-11-16 12:10:56,514 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-16 12:10:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 366 events. 9/366 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1346 event pairs, 0 based on Foata normal form. 88/436 useless extension candidates. Maximal degree in co-relation 240. Up to 7 conditions per place. [2022-11-16 12:10:56,519 INFO L137 encePairwiseOnDemand]: 231/266 looper letters, 4 selfloop transitions, 0 changer transitions 0/226 dead transitions. [2022-11-16 12:10:56,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 226 transitions, 478 flow [2022-11-16 12:10:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:10:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:10:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 487 transitions. [2022-11-16 12:10:56,523 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9154135338345865 [2022-11-16 12:10:56,523 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 487 transitions. [2022-11-16 12:10:56,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 487 transitions. [2022-11-16 12:10:56,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:10:56,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 487 transitions. [2022-11-16 12:10:56,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,528 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,528 INFO L175 Difference]: Start difference. First operand has 228 places, 264 transitions, 546 flow. Second operand 2 states and 487 transitions. [2022-11-16 12:10:56,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 226 transitions, 478 flow [2022-11-16 12:10:56,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:10:56,541 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 470 flow [2022-11-16 12:10:56,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=470, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2022-11-16 12:10:56,544 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2022-11-16 12:10:56,545 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 470 flow [2022-11-16 12:10:56,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,546 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:10:56,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:10:56,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:10:56,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 12:10:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:10:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -886547416, now seen corresponding path program 1 times [2022-11-16 12:10:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:10:56,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140907983] [2022-11-16 12:10:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:10:56,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:10:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:10:56,715 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-16 12:10:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:10:56,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140907983] [2022-11-16 12:10:56,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140907983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:10:56,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:10:56,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:10:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659438338] [2022-11-16 12:10:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:10:56,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:10:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:10:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:10:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:10:56,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 266 [2022-11-16 12:10:56,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:10:56,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 266 [2022-11-16 12:10:56,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:10:56,847 INFO L130 PetriNetUnfolder]: 7/321 cut-off events. [2022-11-16 12:10:56,847 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-16 12:10:56,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 321 events. 7/321 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1021 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 352. Up to 16 conditions per place. [2022-11-16 12:10:56,853 INFO L137 encePairwiseOnDemand]: 263/266 looper letters, 13 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-16 12:10:56,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 508 flow [2022-11-16 12:10:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:10:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:10:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-11-16 12:10:56,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358395989974937 [2022-11-16 12:10:56,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-11-16 12:10:56,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-11-16 12:10:56,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:10:56,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-11-16 12:10:56,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,864 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 470 flow. Second operand 3 states and 667 transitions. [2022-11-16 12:10:56,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 508 flow [2022-11-16 12:10:56,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:10:56,871 INFO L231 Difference]: Finished difference. Result has 229 places, 227 transitions, 482 flow [2022-11-16 12:10:56,872 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2022-11-16 12:10:56,874 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2022-11-16 12:10:56,874 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 482 flow [2022-11-16 12:10:56,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:56,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:10:56,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:10:56,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:10:56,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 12:10:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:10:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash -165554477, now seen corresponding path program 1 times [2022-11-16 12:10:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:10:56,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410043220] [2022-11-16 12:10:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:10:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:10:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:10:57,380 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-16 12:10:57,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:10:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410043220] [2022-11-16 12:10:57,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410043220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:10:57,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:10:57,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:10:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494486857] [2022-11-16 12:10:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:10:57,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:10:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:10:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:10:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:10:57,386 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 266 [2022-11-16 12:10:57,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 482 flow. Second operand has 10 states, 10 states have (on average 165.2) internal successors, (1652), 10 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:10:57,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:10:57,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 266 [2022-11-16 12:10:57,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:11:01,422 INFO L130 PetriNetUnfolder]: 4110/13649 cut-off events. [2022-11-16 12:11:01,422 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2022-11-16 12:11:01,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20345 conditions, 13649 events. 4110/13649 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 163127 event pairs, 731 based on Foata normal form. 0/13024 useless extension candidates. Maximal degree in co-relation 20338. Up to 2356 conditions per place. [2022-11-16 12:11:01,541 INFO L137 encePairwiseOnDemand]: 251/266 looper letters, 229 selfloop transitions, 44 changer transitions 72/505 dead transitions. [2022-11-16 12:11:01,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 505 transitions, 1792 flow [2022-11-16 12:11:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:11:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 12:11:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4213 transitions. [2022-11-16 12:11:01,556 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6599310776942355 [2022-11-16 12:11:01,557 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4213 transitions. [2022-11-16 12:11:01,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4213 transitions. [2022-11-16 12:11:01,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:11:01,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4213 transitions. [2022-11-16 12:11:01,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 175.54166666666666) internal successors, (4213), 24 states have internal predecessors, (4213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:01,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 266.0) internal successors, (6650), 25 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:01,595 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 266.0) internal successors, (6650), 25 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:01,596 INFO L175 Difference]: Start difference. First operand has 229 places, 227 transitions, 482 flow. Second operand 24 states and 4213 transitions. [2022-11-16 12:11:01,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 505 transitions, 1792 flow [2022-11-16 12:11:01,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 505 transitions, 1790 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:11:01,611 INFO L231 Difference]: Finished difference. Result has 262 places, 275 transitions, 777 flow [2022-11-16 12:11:01,612 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=777, PETRI_PLACES=262, PETRI_TRANSITIONS=275} [2022-11-16 12:11:01,613 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, 34 predicate places. [2022-11-16 12:11:01,613 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 275 transitions, 777 flow [2022-11-16 12:11:01,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 165.2) internal successors, (1652), 10 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:01,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:11:01,615 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:01,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:11:01,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-16 12:11:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2027097912, now seen corresponding path program 1 times [2022-11-16 12:11:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:01,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421765241] [2022-11-16 12:11:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:11:01,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:11:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:11:01,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:11:01,741 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:11:01,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-16 12:11:01,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-16 12:11:01,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-16 12:11:01,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-16 12:11:01,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-16 12:11:01,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:11:01,743 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-16 12:11:01,744 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:11:01,744 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 12:11:01,797 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 12:11:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 326 transitions, 682 flow [2022-11-16 12:11:01,922 INFO L130 PetriNetUnfolder]: 106/625 cut-off events. [2022-11-16 12:11:01,922 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 12:11:01,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 625 events. 106/625 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2628 event pairs, 1 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 443. Up to 16 conditions per place. [2022-11-16 12:11:01,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 326 transitions, 682 flow [2022-11-16 12:11:01,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 324 transitions, 678 flow [2022-11-16 12:11:01,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:11:01,948 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;@6c02a917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:11:01,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 12:11:01,970 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-16 12:11:01,970 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:11:01,971 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:11:01,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:01,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 12:11:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1324184345, now seen corresponding path program 1 times [2022-11-16 12:11:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:01,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801980645] [2022-11-16 12:11:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:02,019 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-16 12:11:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801980645] [2022-11-16 12:11:02,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801980645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:02,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:02,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080513333] [2022-11-16 12:11:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:02,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:11:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:11:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:11:02,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 326 [2022-11-16 12:11:02,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 324 transitions, 678 flow. Second operand has 2 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:11:02,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 326 [2022-11-16 12:11:02,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:11:02,155 INFO L130 PetriNetUnfolder]: 16/527 cut-off events. [2022-11-16 12:11:02,155 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-16 12:11:02,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 527 events. 16/527 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2255 event pairs, 1 based on Foata normal form. 205/705 useless extension candidates. Maximal degree in co-relation 380. Up to 16 conditions per place. [2022-11-16 12:11:02,164 INFO L137 encePairwiseOnDemand]: 280/326 looper letters, 6 selfloop transitions, 0 changer transitions 0/274 dead transitions. [2022-11-16 12:11:02,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 274 transitions, 590 flow [2022-11-16 12:11:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:11:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:11:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 592 transitions. [2022-11-16 12:11:02,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9079754601226994 [2022-11-16 12:11:02,167 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 592 transitions. [2022-11-16 12:11:02,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 592 transitions. [2022-11-16 12:11:02,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:11:02,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 592 transitions. [2022-11-16 12:11:02,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 296.0) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,171 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,172 INFO L175 Difference]: Start difference. First operand has 277 places, 324 transitions, 678 flow. Second operand 2 states and 592 transitions. [2022-11-16 12:11:02,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 274 transitions, 590 flow [2022-11-16 12:11:02,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 274 transitions, 590 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:11:02,184 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 578 flow [2022-11-16 12:11:02,185 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=578, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2022-11-16 12:11:02,186 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, -3 predicate places. [2022-11-16 12:11:02,187 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 578 flow [2022-11-16 12:11:02,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:11:02,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:02,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:11:02,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 12:11:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 183367464, now seen corresponding path program 1 times [2022-11-16 12:11:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:02,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943776702] [2022-11-16 12:11:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:02,260 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-16 12:11:02,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:02,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943776702] [2022-11-16 12:11:02,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943776702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:02,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:02,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501731691] [2022-11-16 12:11:02,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:02,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:02,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:02,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:02,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:02,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 326 [2022-11-16 12:11:02,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:11:02,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 326 [2022-11-16 12:11:02,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:11:02,428 INFO L130 PetriNetUnfolder]: 14/482 cut-off events. [2022-11-16 12:11:02,429 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-11-16 12:11:02,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 482 events. 14/482 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1934 event pairs, 1 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 540. Up to 30 conditions per place. [2022-11-16 12:11:02,438 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 15 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2022-11-16 12:11:02,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 278 transitions, 620 flow [2022-11-16 12:11:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:11:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2022-11-16 12:11:02,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8251533742331288 [2022-11-16 12:11:02,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2022-11-16 12:11:02,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2022-11-16 12:11:02,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:11:02,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2022-11-16 12:11:02,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,448 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 578 flow. Second operand 3 states and 807 transitions. [2022-11-16 12:11:02,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 278 transitions, 620 flow [2022-11-16 12:11:02,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:11:02,455 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 590 flow [2022-11-16 12:11:02,455 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2022-11-16 12:11:02,456 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 0 predicate places. [2022-11-16 12:11:02,456 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 590 flow [2022-11-16 12:11:02,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,457 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:11:02,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:02,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:11:02,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 12:11:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1154931475, now seen corresponding path program 1 times [2022-11-16 12:11:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:02,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247991289] [2022-11-16 12:11:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:02,868 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-16 12:11:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:02,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247991289] [2022-11-16 12:11:02,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247991289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:02,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:02,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:11:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193243998] [2022-11-16 12:11:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:02,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:11:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:11:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:11:02,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 326 [2022-11-16 12:11:02,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 275 transitions, 590 flow. Second operand has 10 states, 10 states have (on average 204.2) internal successors, (2042), 10 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:02,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:11:02,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 326 [2022-11-16 12:11:02,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:11:28,680 INFO L130 PetriNetUnfolder]: 55750/139891 cut-off events. [2022-11-16 12:11:28,680 INFO L131 PetriNetUnfolder]: For 2896/2896 co-relation queries the response was YES. [2022-11-16 12:11:29,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218765 conditions, 139891 events. 55750/139891 cut-off events. For 2896/2896 co-relation queries the response was YES. Maximal size of possible extension queue 5504. Compared 1995716 event pairs, 11525 based on Foata normal form. 0/134253 useless extension candidates. Maximal degree in co-relation 218757. Up to 29711 conditions per place. [2022-11-16 12:11:30,065 INFO L137 encePairwiseOnDemand]: 310/326 looper letters, 443 selfloop transitions, 58 changer transitions 0/700 dead transitions. [2022-11-16 12:11:30,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 700 transitions, 2606 flow [2022-11-16 12:11:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:11:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 12:11:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5305 transitions. [2022-11-16 12:11:30,084 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6780419222903885 [2022-11-16 12:11:30,084 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5305 transitions. [2022-11-16 12:11:30,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5305 transitions. [2022-11-16 12:11:30,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:11:30,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5305 transitions. [2022-11-16 12:11:30,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 221.04166666666666) internal successors, (5305), 24 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:30,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 326.0) internal successors, (8150), 25 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:30,125 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 326.0) internal successors, (8150), 25 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:30,125 INFO L175 Difference]: Start difference. First operand has 277 places, 275 transitions, 590 flow. Second operand 24 states and 5305 transitions. [2022-11-16 12:11:30,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 700 transitions, 2606 flow [2022-11-16 12:11:30,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 700 transitions, 2604 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:11:30,144 INFO L231 Difference]: Finished difference. Result has 313 places, 336 transitions, 1010 flow [2022-11-16 12:11:30,145 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1010, PETRI_PLACES=313, PETRI_TRANSITIONS=336} [2022-11-16 12:11:30,148 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 36 predicate places. [2022-11-16 12:11:30,149 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 336 transitions, 1010 flow [2022-11-16 12:11:30,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 204.2) internal successors, (2042), 10 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:30,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:11:30,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:11:30,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 12:11:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1247338263, now seen corresponding path program 1 times [2022-11-16 12:11:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:30,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473822036] [2022-11-16 12:11:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:30,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:30,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473822036] [2022-11-16 12:11:30,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473822036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:30,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437087256] [2022-11-16 12:11:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:30,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:30,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:30,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:30,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:11:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:30,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:11:30,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:30,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:30,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437087256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:11:30,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:11:30,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 12:11:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396162403] [2022-11-16 12:11:30,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:30,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:11:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:11:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:11:30,712 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 326 [2022-11-16 12:11:30,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 336 transitions, 1010 flow. Second operand has 10 states, 10 states have (on average 264.3) internal successors, (2643), 10 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:30,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:11:30,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 326 [2022-11-16 12:11:30,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:11:32,103 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 170#L1040-5true, 164#L1013-32true, 312#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), t_funThread1of3ForFork0InUse, Black: 308#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), t_funThread2of3ForFork0NotInUse, Black: 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), t_funThread3of3ForFork0NotInUse, Black: 292#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 300#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 320#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= 3 |~#A~0.base|)), Black: 291#(= 3 |~#A~0.base|), Black: 293#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0))]) [2022-11-16 12:11:32,103 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-16 12:11:32,103 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-16 12:11:32,104 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-16 12:11:32,104 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-16 12:11:32,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1297] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 235#L999-1true, 170#L1040-5true, 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), t_funThread1of3ForFork0InUse, Black: 308#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), t_funThread2of3ForFork0NotInUse, Black: 292#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), t_funThread3of3ForFork0NotInUse, Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 300#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 320#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= 3 |~#A~0.base|)), Black: 291#(= 3 |~#A~0.base|), Black: 293#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0))]) [2022-11-16 12:11:32,131 INFO L383 tUnfolder$Statistics]: this new event has 191 ancestors and is cut-off event [2022-11-16 12:11:32,132 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-16 12:11:32,132 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-16 12:11:32,132 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-16 12:11:32,227 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1296] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][307], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 170#L1040-5true, 292#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 3#L1013-8true, 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), t_funThread1of3ForFork0InUse, Black: 308#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), t_funThread2of3ForFork0NotInUse, Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), t_funThread3of3ForFork0NotInUse, Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 300#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 320#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= 3 |~#A~0.base|)), Black: 291#(= 3 |~#A~0.base|), Black: 293#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0))]) [2022-11-16 12:11:32,228 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is not cut-off event [2022-11-16 12:11:32,228 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-11-16 12:11:32,228 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-11-16 12:11:32,228 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-16 12:11:32,308 INFO L130 PetriNetUnfolder]: 553/4259 cut-off events. [2022-11-16 12:11:32,308 INFO L131 PetriNetUnfolder]: For 7410/8035 co-relation queries the response was YES. [2022-11-16 12:11:32,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8534 conditions, 4259 events. 553/4259 cut-off events. For 7410/8035 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 42706 event pairs, 127 based on Foata normal form. 36/4076 useless extension candidates. Maximal degree in co-relation 8512. Up to 483 conditions per place. [2022-11-16 12:11:32,429 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 16 selfloop transitions, 9 changer transitions 0/346 dead transitions. [2022-11-16 12:11:32,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 346 transitions, 1082 flow [2022-11-16 12:11:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:11:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:11:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2385 transitions. [2022-11-16 12:11:32,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2022-11-16 12:11:32,438 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2385 transitions. [2022-11-16 12:11:32,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2385 transitions. [2022-11-16 12:11:32,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:11:32,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2385 transitions. [2022-11-16 12:11:32,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:32,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:32,459 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:32,459 INFO L175 Difference]: Start difference. First operand has 313 places, 336 transitions, 1010 flow. Second operand 9 states and 2385 transitions. [2022-11-16 12:11:32,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 346 transitions, 1082 flow [2022-11-16 12:11:32,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 346 transitions, 1081 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:11:32,543 INFO L231 Difference]: Finished difference. Result has 323 places, 342 transitions, 1059 flow [2022-11-16 12:11:32,544 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1059, PETRI_PLACES=323, PETRI_TRANSITIONS=342} [2022-11-16 12:11:32,545 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 46 predicate places. [2022-11-16 12:11:32,545 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 342 transitions, 1059 flow [2022-11-16 12:11:32,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 264.3) internal successors, (2643), 10 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:32,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:11:32,558 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:32,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:32,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:11:32,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-16 12:11:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1195502371, now seen corresponding path program 1 times [2022-11-16 12:11:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:32,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758910507] [2022-11-16 12:11:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:11:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:33,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758910507] [2022-11-16 12:11:33,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758910507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:33,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867830537] [2022-11-16 12:11:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:33,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:33,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:33,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c78b8580-eced-44f8-b498-b4d4acb7929e/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:11:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:33,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 12:11:33,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:34,028 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:11:34,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:11:34,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:11:34,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:11:34,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:11:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:11:34,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:35,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-16 12:11:35,194 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:11:35,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-16 12:11:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:11:35,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867830537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:11:35,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:11:35,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-11-16 12:11:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53237833] [2022-11-16 12:11:35,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:35,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:11:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:11:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=191, Unknown=2, NotChecked=0, Total=240 [2022-11-16 12:11:35,221 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 326 [2022-11-16 12:11:35,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 342 transitions, 1059 flow. Second operand has 16 states, 16 states have (on average 205.125) internal successors, (3282), 16 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:35,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:11:35,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 326 [2022-11-16 12:11:35,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand