./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc --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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- 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-5e519f3 [2022-11-02 20:51:24,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:24,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:24,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:24,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:24,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:24,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:24,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:24,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:24,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:24,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:24,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:24,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:24,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:24,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:24,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:24,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:24,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:24,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:24,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:24,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:24,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:24,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:24,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:24,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:24,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:24,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:24,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:24,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:24,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:24,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:24,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:24,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:24,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:24,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:24,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:24,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:24,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:24,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:24,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:24,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:24,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:51:24,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:24,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:24,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:24,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:24,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:24,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:24,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:24,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:24,518 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:24,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:24,520 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:24,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:24,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:24,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:24,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:24,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:24,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:24,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:24,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:24,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:24,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:24,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:24,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:24,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:24,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:24,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:24,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:24,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:24,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:24,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:24,524 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:24,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:24,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:24,525 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_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/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_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2022-11-02 20:51:24,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:24,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:24,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:24,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:24,805 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:24,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2022-11-02 20:51:24,892 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/data/a03bb8ec7/9d262905e42440cc9ae1c60ae04550db/FLAGd11d7667e [2022-11-02 20:51:25,486 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:25,486 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2022-11-02 20:51:25,498 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/data/a03bb8ec7/9d262905e42440cc9ae1c60ae04550db/FLAGd11d7667e [2022-11-02 20:51:25,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/data/a03bb8ec7/9d262905e42440cc9ae1c60ae04550db [2022-11-02 20:51:25,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:25,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:25,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:25,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:25,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:25,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:25" (1/1) ... [2022-11-02 20:51:25,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce2cf33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:25, skipping insertion in model container [2022-11-02 20:51:25,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:25" (1/1) ... [2022-11-02 20:51:25,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:25,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:26,246 WARN L230 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_4ef25713-50c8-491f-824d-c7bc7394f847/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i[30422,30435] [2022-11-02 20:51:26,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:26,268 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:26,310 WARN L230 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_4ef25713-50c8-491f-824d-c7bc7394f847/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i[30422,30435] [2022-11-02 20:51:26,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:26,347 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:26,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26 WrapperNode [2022-11-02 20:51:26,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:26,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:26,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:26,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:26,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,416 INFO L138 Inliner]: procedures = 170, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 59 [2022-11-02 20:51:26,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:26,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:26,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:26,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:26,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:26,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:26,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:26,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:26,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:26,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:26,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:26,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef25713-50c8-491f-824d-c7bc7394f847/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-02 20:51:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-02 20:51:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:26,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:26,564 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:51:26,748 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:26,751 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:26,919 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:26,996 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:27,009 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:51:27,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:27 BoogieIcfgContainer [2022-11-02 20:51:27,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:27,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:27,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:27,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:27,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:25" (1/3) ... [2022-11-02 20:51:27,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136785e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:27, skipping insertion in model container [2022-11-02 20:51:27,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (2/3) ... [2022-11-02 20:51:27,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136785e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:27, skipping insertion in model container [2022-11-02 20:51:27,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:27" (3/3) ... [2022-11-02 20:51:27,028 INFO L112 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2022-11-02 20:51:27,038 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:51:27,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:27,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:51:27,051 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:51:27,152 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:51:27,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 117 flow [2022-11-02 20:51:27,233 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-11-02 20:51:27,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:27,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 67 events. 6/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2022-11-02 20:51:27,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 117 flow [2022-11-02 20:51:27,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 117 flow [2022-11-02 20:51:27,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:27,259 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;@1433629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:27,259 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-02 20:51:27,273 INFO L130 PetriNetUnfolder]: 2/45 cut-off events. [2022-11-02 20:51:27,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:27,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:27,275 INFO L208 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] [2022-11-02 20:51:27,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1552839894, now seen corresponding path program 1 times [2022-11-02 20:51:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:27,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442580454] [2022-11-02 20:51:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:27,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:27,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:27,461 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:51:27,463 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2022-11-02 20:51:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-11-02 20:51:27,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-11-02 20:51:27,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:27,466 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-02 20:51:27,470 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:51:27,471 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 20:51:27,497 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:51:27,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 84 transitions, 180 flow [2022-11-02 20:51:27,530 INFO L130 PetriNetUnfolder]: 11/108 cut-off events. [2022-11-02 20:51:27,531 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:51:27,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 11/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 183 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2022-11-02 20:51:27,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 84 transitions, 180 flow [2022-11-02 20:51:27,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 84 transitions, 180 flow [2022-11-02 20:51:27,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:27,539 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;@1433629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:27,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 20:51:27,625 INFO L130 PetriNetUnfolder]: 6/77 cut-off events. [2022-11-02 20:51:27,625 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:51:27,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:27,625 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:27,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:51:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1549820851, now seen corresponding path program 1 times [2022-11-02 20:51:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:27,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134323277] [2022-11-02 20:51:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:27,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:27,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:27,679 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:51:27,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-02 20:51:27,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-02 20:51:27,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-02 20:51:27,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-02 20:51:27,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:27,681 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-02 20:51:27,682 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:51:27,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-02 20:51:27,711 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:51:27,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 112 transitions, 245 flow [2022-11-02 20:51:27,746 INFO L130 PetriNetUnfolder]: 16/149 cut-off events. [2022-11-02 20:51:27,746 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:51:27,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 149 events. 16/149 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 112. Up to 8 conditions per place. [2022-11-02 20:51:27,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 112 transitions, 245 flow [2022-11-02 20:51:27,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 112 transitions, 245 flow [2022-11-02 20:51:27,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:27,754 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;@1433629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:27,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:51:27,774 INFO L130 PetriNetUnfolder]: 6/88 cut-off events. [2022-11-02 20:51:27,777 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:51:27,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:27,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:27,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-02 20:51:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 290827468, now seen corresponding path program 1 times [2022-11-02 20:51:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:27,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141025693] [2022-11-02 20:51:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:27,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:28,033 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-02 20:51:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:28,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141025693] [2022-11-02 20:51:28,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141025693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:28,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:28,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:28,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883552968] [2022-11-02 20:51:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:28,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:28,102 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-11-02 20:51:28,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:28,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-11-02 20:51:28,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:28,447 INFO L130 PetriNetUnfolder]: 230/859 cut-off events. [2022-11-02 20:51:28,448 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-02 20:51:28,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 859 events. 230/859 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5699 event pairs, 114 based on Foata normal form. 203/902 useless extension candidates. Maximal degree in co-relation 313. Up to 206 conditions per place. [2022-11-02 20:51:28,467 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 21 selfloop transitions, 1 changer transitions 0/107 dead transitions. [2022-11-02 20:51:28,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 291 flow [2022-11-02 20:51:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-11-02 20:51:28,488 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9017857142857143 [2022-11-02 20:51:28,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2022-11-02 20:51:28,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2022-11-02 20:51:28,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:28,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2022-11-02 20:51:28,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,511 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 245 flow. Second operand 3 states and 303 transitions. [2022-11-02 20:51:28,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 291 flow [2022-11-02 20:51:28,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 107 transitions, 283 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:28,526 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 218 flow [2022-11-02 20:51:28,529 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2022-11-02 20:51:28,534 INFO L287 CegarLoopForPetriNet]: 106 programPoint places, -6 predicate places. [2022-11-02 20:51:28,534 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 218 flow [2022-11-02 20:51:28,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:28,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:28,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-02 20:51:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 290828491, now seen corresponding path program 1 times [2022-11-02 20:51:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:28,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014608611] [2022-11-02 20:51:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:28,637 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-02 20:51:28,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:28,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014608611] [2022-11-02 20:51:28,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014608611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:28,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:28,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492621678] [2022-11-02 20:51:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:28,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:28,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:28,641 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-11-02 20:51:28,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:28,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-11-02 20:51:28,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:28,952 INFO L130 PetriNetUnfolder]: 336/1288 cut-off events. [2022-11-02 20:51:28,952 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-11-02 20:51:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 1288 events. 336/1288 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 10165 event pairs, 168 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 1847. Up to 299 conditions per place. [2022-11-02 20:51:28,967 INFO L137 encePairwiseOnDemand]: 108/112 looper letters, 24 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2022-11-02 20:51:28,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 107 transitions, 298 flow [2022-11-02 20:51:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-11-02 20:51:28,970 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8422619047619048 [2022-11-02 20:51:28,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2022-11-02 20:51:28,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2022-11-02 20:51:28,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:28,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2022-11-02 20:51:28,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,977 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 218 flow. Second operand 3 states and 283 transitions. [2022-11-02 20:51:28,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 107 transitions, 298 flow [2022-11-02 20:51:28,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 107 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:28,985 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 235 flow [2022-11-02 20:51:28,985 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2022-11-02 20:51:28,986 INFO L287 CegarLoopForPetriNet]: 106 programPoint places, -3 predicate places. [2022-11-02 20:51:28,986 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 235 flow [2022-11-02 20:51:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:28,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:28,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:28,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-02 20:51:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 289874156, now seen corresponding path program 1 times [2022-11-02 20:51:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:28,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814446755] [2022-11-02 20:51:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,090 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-02 20:51:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:29,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814446755] [2022-11-02 20:51:29,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814446755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:29,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:29,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85188816] [2022-11-02 20:51:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:29,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:29,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:29,099 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-11-02 20:51:29,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:29,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-11-02 20:51:29,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:29,346 INFO L130 PetriNetUnfolder]: 276/1108 cut-off events. [2022-11-02 20:51:29,346 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-11-02 20:51:29,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 1108 events. 276/1108 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8310 event pairs, 150 based on Foata normal form. 26/1027 useless extension candidates. Maximal degree in co-relation 1608. Up to 268 conditions per place. [2022-11-02 20:51:29,361 INFO L137 encePairwiseOnDemand]: 109/112 looper letters, 24 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2022-11-02 20:51:29,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 105 transitions, 297 flow [2022-11-02 20:51:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2022-11-02 20:51:29,366 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2022-11-02 20:51:29,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2022-11-02 20:51:29,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2022-11-02 20:51:29,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:29,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2022-11-02 20:51:29,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,377 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 235 flow. Second operand 3 states and 282 transitions. [2022-11-02 20:51:29,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 105 transitions, 297 flow [2022-11-02 20:51:29,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 105 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:29,385 INFO L231 Difference]: Finished difference. Result has 104 places, 98 transitions, 224 flow [2022-11-02 20:51:29,386 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=104, PETRI_TRANSITIONS=98} [2022-11-02 20:51:29,388 INFO L287 CegarLoopForPetriNet]: 106 programPoint places, -2 predicate places. [2022-11-02 20:51:29,388 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 98 transitions, 224 flow [2022-11-02 20:51:29,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:29,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:29,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:29,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-02 20:51:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 289875179, now seen corresponding path program 1 times [2022-11-02 20:51:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:29,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873862513] [2022-11-02 20:51:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,450 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-02 20:51:29,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:29,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873862513] [2022-11-02 20:51:29,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873862513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:29,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:29,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366739733] [2022-11-02 20:51:29,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:29,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:29,453 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-11-02 20:51:29,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 98 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:29,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-11-02 20:51:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:29,612 INFO L130 PetriNetUnfolder]: 186/750 cut-off events. [2022-11-02 20:51:29,613 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-11-02 20:51:29,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 750 events. 186/750 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4910 event pairs, 96 based on Foata normal form. 13/671 useless extension candidates. Maximal degree in co-relation 909. Up to 175 conditions per place. [2022-11-02 20:51:29,622 INFO L137 encePairwiseOnDemand]: 110/112 looper letters, 20 selfloop transitions, 1 changer transitions 0/103 dead transitions. [2022-11-02 20:51:29,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 284 flow [2022-11-02 20:51:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2022-11-02 20:51:29,623 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2022-11-02 20:51:29,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2022-11-02 20:51:29,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2022-11-02 20:51:29,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:29,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2022-11-02 20:51:29,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,627 INFO L175 Difference]: Start difference. First operand has 104 places, 98 transitions, 224 flow. Second operand 3 states and 292 transitions. [2022-11-02 20:51:29,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 284 flow [2022-11-02 20:51:29,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 279 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:51:29,630 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 218 flow [2022-11-02 20:51:29,630 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2022-11-02 20:51:29,631 INFO L287 CegarLoopForPetriNet]: 106 programPoint places, -4 predicate places. [2022-11-02 20:51:29,631 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 218 flow [2022-11-02 20:51:29,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:29,632 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:29,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:29,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-02 20:51:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -337068427, now seen corresponding path program 1 times [2022-11-02 20:51:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:29,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847566692] [2022-11-02 20:51:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:29,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:29,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:29,663 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:51:29,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-02 20:51:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-02 20:51:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-02 20:51:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-02 20:51:29,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-02 20:51:29,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:29,665 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-02 20:51:29,665 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:51:29,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-02 20:51:29,692 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:51:29,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 140 transitions, 312 flow [2022-11-02 20:51:29,728 INFO L130 PetriNetUnfolder]: 21/190 cut-off events. [2022-11-02 20:51:29,728 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-02 20:51:29,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 190 events. 21/190 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 484 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 157. Up to 10 conditions per place. [2022-11-02 20:51:29,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 140 transitions, 312 flow [2022-11-02 20:51:29,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 140 transitions, 312 flow [2022-11-02 20:51:29,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:29,746 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;@1433629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:29,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:51:29,755 INFO L130 PetriNetUnfolder]: 7/90 cut-off events. [2022-11-02 20:51:29,755 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:51:29,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:29,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:29,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1050254578, now seen corresponding path program 1 times [2022-11-02 20:51:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:29,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874149331] [2022-11-02 20:51:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,818 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-02 20:51:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:29,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874149331] [2022-11-02 20:51:29,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874149331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:29,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:29,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129402726] [2022-11-02 20:51:29,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:29,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:29,825 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2022-11-02 20:51:29,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 140 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:29,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:29,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2022-11-02 20:51:29,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:30,982 INFO L130 PetriNetUnfolder]: 1472/5084 cut-off events. [2022-11-02 20:51:30,983 INFO L131 PetriNetUnfolder]: For 2029/2029 co-relation queries the response was YES. [2022-11-02 20:51:31,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7983 conditions, 5084 events. 1472/5084 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 50575 event pairs, 771 based on Foata normal form. 1083/5480 useless extension candidates. Maximal degree in co-relation 2515. Up to 1172 conditions per place. [2022-11-02 20:51:31,065 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 31 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2022-11-02 20:51:31,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 137 transitions, 395 flow [2022-11-02 20:51:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-11-02 20:51:31,067 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2022-11-02 20:51:31,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2022-11-02 20:51:31,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2022-11-02 20:51:31,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:31,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2022-11-02 20:51:31,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,071 INFO L175 Difference]: Start difference. First operand has 132 places, 140 transitions, 312 flow. Second operand 3 states and 372 transitions. [2022-11-02 20:51:31,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 137 transitions, 395 flow [2022-11-02 20:51:31,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 137 transitions, 377 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:31,077 INFO L231 Difference]: Finished difference. Result has 126 places, 127 transitions, 294 flow [2022-11-02 20:51:31,078 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=126, PETRI_TRANSITIONS=127} [2022-11-02 20:51:31,081 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -6 predicate places. [2022-11-02 20:51:31,081 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 127 transitions, 294 flow [2022-11-02 20:51:31,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:31,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:31,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:31,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1050253555, now seen corresponding path program 1 times [2022-11-02 20:51:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845462623] [2022-11-02 20:51:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:31,152 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-02 20:51:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:31,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845462623] [2022-11-02 20:51:31,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845462623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:31,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:31,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:31,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039595813] [2022-11-02 20:51:31,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:31,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:31,158 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-02 20:51:31,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 127 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:31,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-02 20:51:31,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:31,960 INFO L130 PetriNetUnfolder]: 1062/3773 cut-off events. [2022-11-02 20:51:31,960 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-11-02 20:51:31,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 3773 events. 1062/3773 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 35460 event pairs, 609 based on Foata normal form. 0/3299 useless extension candidates. Maximal degree in co-relation 4941. Up to 930 conditions per place. [2022-11-02 20:51:32,025 INFO L137 encePairwiseOnDemand]: 138/140 looper letters, 27 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2022-11-02 20:51:32,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 137 transitions, 383 flow [2022-11-02 20:51:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2022-11-02 20:51:32,028 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2022-11-02 20:51:32,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2022-11-02 20:51:32,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2022-11-02 20:51:32,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:32,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2022-11-02 20:51:32,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,032 INFO L175 Difference]: Start difference. First operand has 126 places, 127 transitions, 294 flow. Second operand 3 states and 368 transitions. [2022-11-02 20:51:32,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 137 transitions, 383 flow [2022-11-02 20:51:32,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 378 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:32,040 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 290 flow [2022-11-02 20:51:32,041 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2022-11-02 20:51:32,041 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -4 predicate places. [2022-11-02 20:51:32,042 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 290 flow [2022-11-02 20:51:32,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:32,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:32,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:32,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1049301266, now seen corresponding path program 1 times [2022-11-02 20:51:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:32,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022285710] [2022-11-02 20:51:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,091 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-02 20:51:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022285710] [2022-11-02 20:51:32,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022285710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:32,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:32,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20655240] [2022-11-02 20:51:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:32,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:32,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:32,095 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-02 20:51:32,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:32,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-02 20:51:32,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:32,696 INFO L130 PetriNetUnfolder]: 864/3097 cut-off events. [2022-11-02 20:51:32,697 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-11-02 20:51:32,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4757 conditions, 3097 events. 864/3097 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 27385 event pairs, 447 based on Foata normal form. 40/2786 useless extension candidates. Maximal degree in co-relation 3964. Up to 688 conditions per place. [2022-11-02 20:51:32,809 INFO L137 encePairwiseOnDemand]: 138/140 looper letters, 26 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2022-11-02 20:51:32,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 370 flow [2022-11-02 20:51:32,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-11-02 20:51:32,811 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2022-11-02 20:51:32,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-11-02 20:51:32,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-11-02 20:51:32,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:32,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-11-02 20:51:32,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,815 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 290 flow. Second operand 3 states and 367 transitions. [2022-11-02 20:51:32,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 370 flow [2022-11-02 20:51:32,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 134 transitions, 363 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:51:32,820 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 279 flow [2022-11-02 20:51:32,821 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2022-11-02 20:51:32,821 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -4 predicate places. [2022-11-02 20:51:32,821 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 279 flow [2022-11-02 20:51:32,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:32,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:32,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:51:32,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1049300243, now seen corresponding path program 1 times [2022-11-02 20:51:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:32,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326760290] [2022-11-02 20:51:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,852 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-02 20:51:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326760290] [2022-11-02 20:51:32,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326760290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:32,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:32,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587053709] [2022-11-02 20:51:32,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:32,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:32,855 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2022-11-02 20:51:32,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:32,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:32,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2022-11-02 20:51:32,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:33,581 INFO L130 PetriNetUnfolder]: 1200/4364 cut-off events. [2022-11-02 20:51:33,581 INFO L131 PetriNetUnfolder]: For 509/509 co-relation queries the response was YES. [2022-11-02 20:51:33,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6467 conditions, 4364 events. 1200/4364 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 42778 event pairs, 690 based on Foata normal form. 0/3871 useless extension candidates. Maximal degree in co-relation 6330. Up to 1051 conditions per place. [2022-11-02 20:51:33,646 INFO L137 encePairwiseOnDemand]: 138/140 looper letters, 29 selfloop transitions, 1 changer transitions 0/132 dead transitions. [2022-11-02 20:51:33,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 369 flow [2022-11-02 20:51:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2022-11-02 20:51:33,648 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2022-11-02 20:51:33,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2022-11-02 20:51:33,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2022-11-02 20:51:33,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:33,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2022-11-02 20:51:33,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,651 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 279 flow. Second operand 3 states and 355 transitions. [2022-11-02 20:51:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 369 flow [2022-11-02 20:51:33,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 132 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:33,657 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 275 flow [2022-11-02 20:51:33,658 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2022-11-02 20:51:33,658 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -5 predicate places. [2022-11-02 20:51:33,659 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 275 flow [2022-11-02 20:51:33,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:33,660 INFO L208 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] [2022-11-02 20:51:33,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:51:33,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash -344456956, now seen corresponding path program 1 times [2022-11-02 20:51:33,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:33,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164039551] [2022-11-02 20:51:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:33,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164039551] [2022-11-02 20:51:33,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164039551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:33,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:33,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822458626] [2022-11-02 20:51:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:33,696 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2022-11-02 20:51:33,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:33,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:33,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2022-11-02 20:51:33,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:34,703 INFO L130 PetriNetUnfolder]: 1850/5480 cut-off events. [2022-11-02 20:51:34,703 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2022-11-02 20:51:34,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8599 conditions, 5480 events. 1850/5480 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 53028 event pairs, 1062 based on Foata normal form. 0/4607 useless extension candidates. Maximal degree in co-relation 6356. Up to 1587 conditions per place. [2022-11-02 20:51:34,823 INFO L137 encePairwiseOnDemand]: 135/140 looper letters, 30 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2022-11-02 20:51:34,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 373 flow [2022-11-02 20:51:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-11-02 20:51:34,826 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2022-11-02 20:51:34,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-11-02 20:51:34,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-11-02 20:51:34,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:34,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-11-02 20:51:34,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:34,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:34,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:34,830 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 275 flow. Second operand 3 states and 359 transitions. [2022-11-02 20:51:34,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 373 flow [2022-11-02 20:51:34,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 133 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:34,835 INFO L231 Difference]: Finished difference. Result has 130 places, 124 transitions, 298 flow [2022-11-02 20:51:34,835 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=130, PETRI_TRANSITIONS=124} [2022-11-02 20:51:34,836 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -2 predicate places. [2022-11-02 20:51:34,836 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 124 transitions, 298 flow [2022-11-02 20:51:34,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:34,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:34,837 INFO L208 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] [2022-11-02 20:51:34,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:51:34,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash -343502621, now seen corresponding path program 1 times [2022-11-02 20:51:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203023851] [2022-11-02 20:51:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:34,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203023851] [2022-11-02 20:51:34,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203023851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:34,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:34,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150753915] [2022-11-02 20:51:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:34,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:34,881 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2022-11-02 20:51:34,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:34,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:34,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2022-11-02 20:51:34,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:35,796 INFO L130 PetriNetUnfolder]: 1746/5376 cut-off events. [2022-11-02 20:51:35,796 INFO L131 PetriNetUnfolder]: For 1305/1305 co-relation queries the response was YES. [2022-11-02 20:51:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8704 conditions, 5376 events. 1746/5376 cut-off events. For 1305/1305 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 53024 event pairs, 1062 based on Foata normal form. 104/4754 useless extension candidates. Maximal degree in co-relation 6030. Up to 1587 conditions per place. [2022-11-02 20:51:35,884 INFO L137 encePairwiseOnDemand]: 137/140 looper letters, 30 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2022-11-02 20:51:35,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 131 transitions, 376 flow [2022-11-02 20:51:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2022-11-02 20:51:35,886 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.85 [2022-11-02 20:51:35,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2022-11-02 20:51:35,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2022-11-02 20:51:35,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:35,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2022-11-02 20:51:35,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 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-02 20:51:35,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:35,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:35,889 INFO L175 Difference]: Start difference. First operand has 130 places, 124 transitions, 298 flow. Second operand 3 states and 357 transitions. [2022-11-02 20:51:35,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 131 transitions, 376 flow [2022-11-02 20:51:35,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 131 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:35,896 INFO L231 Difference]: Finished difference. Result has 131 places, 122 transitions, 287 flow [2022-11-02 20:51:35,897 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=131, PETRI_TRANSITIONS=122} [2022-11-02 20:51:35,897 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, -1 predicate places. [2022-11-02 20:51:35,898 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 122 transitions, 287 flow [2022-11-02 20:51:35,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:35,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:35,898 INFO L208 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] [2022-11-02 20:51:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:51:35,899 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash -343503644, now seen corresponding path program 1 times [2022-11-02 20:51:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:35,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590975420] [2022-11-02 20:51:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:35,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590975420] [2022-11-02 20:51:35,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590975420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:35,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:35,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689195096] [2022-11-02 20:51:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:35,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:35,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:35,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:35,946 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-02 20:51:35,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 122 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:35,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:35,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-02 20:51:35,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:36,516 INFO L130 PetriNetUnfolder]: 1206/3596 cut-off events. [2022-11-02 20:51:36,516 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-11-02 20:51:36,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5972 conditions, 3596 events. 1206/3596 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32175 event pairs, 729 based on Foata normal form. 0/3008 useless extension candidates. Maximal degree in co-relation 4576. Up to 1098 conditions per place. [2022-11-02 20:51:36,565 INFO L137 encePairwiseOnDemand]: 138/140 looper letters, 26 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2022-11-02 20:51:36,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 131 transitions, 367 flow [2022-11-02 20:51:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-11-02 20:51:36,566 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2022-11-02 20:51:36,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-11-02 20:51:36,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-11-02 20:51:36,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:36,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-11-02 20:51:36,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:36,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:36,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:36,571 INFO L175 Difference]: Start difference. First operand has 131 places, 122 transitions, 287 flow. Second operand 3 states and 367 transitions. [2022-11-02 20:51:36,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 131 transitions, 367 flow [2022-11-02 20:51:36,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 364 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:36,577 INFO L231 Difference]: Finished difference. Result has 133 places, 121 transitions, 285 flow [2022-11-02 20:51:36,578 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=133, PETRI_TRANSITIONS=121} [2022-11-02 20:51:36,578 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, 1 predicate places. [2022-11-02 20:51:36,579 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 285 flow [2022-11-02 20:51:36,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:36,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:36,579 INFO L208 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] [2022-11-02 20:51:36,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:51:36,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash -344455933, now seen corresponding path program 1 times [2022-11-02 20:51:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:36,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544830925] [2022-11-02 20:51:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:36,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544830925] [2022-11-02 20:51:36,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544830925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:36,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:36,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800247064] [2022-11-02 20:51:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:36,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:36,617 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-02 20:51:36,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:36,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:36,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-02 20:51:36,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:37,152 INFO L130 PetriNetUnfolder]: 1095/3329 cut-off events. [2022-11-02 20:51:37,152 INFO L131 PetriNetUnfolder]: For 601/601 co-relation queries the response was YES. [2022-11-02 20:51:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 3329 events. 1095/3329 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 29262 event pairs, 618 based on Foata normal form. 52/2894 useless extension candidates. Maximal degree in co-relation 3854. Up to 935 conditions per place. [2022-11-02 20:51:37,199 INFO L137 encePairwiseOnDemand]: 138/140 looper letters, 25 selfloop transitions, 1 changer transitions 0/128 dead transitions. [2022-11-02 20:51:37,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 359 flow [2022-11-02 20:51:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-02 20:51:37,201 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2022-11-02 20:51:37,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-02 20:51:37,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-02 20:51:37,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:37,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-02 20:51:37,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:37,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:37,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:37,205 INFO L175 Difference]: Start difference. First operand has 133 places, 121 transitions, 285 flow. Second operand 3 states and 366 transitions. [2022-11-02 20:51:37,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 359 flow [2022-11-02 20:51:37,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 355 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:37,212 INFO L231 Difference]: Finished difference. Result has 132 places, 119 transitions, 280 flow [2022-11-02 20:51:37,212 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=132, PETRI_TRANSITIONS=119} [2022-11-02 20:51:37,213 INFO L287 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2022-11-02 20:51:37,213 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 119 transitions, 280 flow [2022-11-02 20:51:37,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:37,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:37,214 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:37,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:51:37,214 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:51:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1821018244, now seen corresponding path program 1 times [2022-11-02 20:51:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:37,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51693730] [2022-11-02 20:51:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:37,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:51:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:51:37,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:51:37,267 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:51:37,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-02 20:51:37,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-02 20:51:37,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-02 20:51:37,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-02 20:51:37,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-02 20:51:37,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-02 20:51:37,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:51:37,269 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:37,270 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:51:37,270 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-02 20:51:37,319 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:51:37,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 168 transitions, 381 flow [2022-11-02 20:51:37,368 INFO L130 PetriNetUnfolder]: 26/231 cut-off events. [2022-11-02 20:51:37,369 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-02 20:51:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 231 events. 26/231 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 622 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 203. Up to 12 conditions per place. [2022-11-02 20:51:37,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 168 transitions, 381 flow [2022-11-02 20:51:37,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 168 transitions, 381 flow [2022-11-02 20:51:37,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:37,377 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;@1433629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:37,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 20:51:37,386 INFO L130 PetriNetUnfolder]: 7/90 cut-off events. [2022-11-02 20:51:37,386 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:51:37,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:37,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:37,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash 47725525, now seen corresponding path program 1 times [2022-11-02 20:51:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:37,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064078439] [2022-11-02 20:51:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,416 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-02 20:51:37,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:37,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064078439] [2022-11-02 20:51:37,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064078439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:37,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:37,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649812947] [2022-11-02 20:51:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:37,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:37,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:37,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:37,420 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2022-11-02 20:51:37,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 168 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:37,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:37,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2022-11-02 20:51:37,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:39,338 INFO L130 PetriNetUnfolder]: 3553/11127 cut-off events. [2022-11-02 20:51:39,338 INFO L131 PetriNetUnfolder]: For 6185/6185 co-relation queries the response was YES. [2022-11-02 20:51:39,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17910 conditions, 11127 events. 3553/11127 cut-off events. For 6185/6185 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 119621 event pairs, 1824 based on Foata normal form. 2536/12221 useless extension candidates. Maximal degree in co-relation 4767. Up to 2551 conditions per place. [2022-11-02 20:51:39,497 INFO L137 encePairwiseOnDemand]: 158/168 looper letters, 32 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-11-02 20:51:39,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 475 flow [2022-11-02 20:51:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-11-02 20:51:39,499 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9067460317460317 [2022-11-02 20:51:39,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2022-11-02 20:51:39,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2022-11-02 20:51:39,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:39,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2022-11-02 20:51:39,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:39,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:39,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:39,504 INFO L175 Difference]: Start difference. First operand has 158 places, 168 transitions, 381 flow. Second operand 3 states and 457 transitions. [2022-11-02 20:51:39,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 475 flow [2022-11-02 20:51:39,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 443 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:39,511 INFO L231 Difference]: Finished difference. Result has 151 places, 152 transitions, 341 flow [2022-11-02 20:51:39,512 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=151, PETRI_TRANSITIONS=152} [2022-11-02 20:51:39,513 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -7 predicate places. [2022-11-02 20:51:39,513 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 152 transitions, 341 flow [2022-11-02 20:51:39,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:39,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:39,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:39,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:51:39,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:39,515 INFO L85 PathProgramCache]: Analyzing trace with hash 47724502, now seen corresponding path program 1 times [2022-11-02 20:51:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:39,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935159433] [2022-11-02 20:51:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,565 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-02 20:51:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:39,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935159433] [2022-11-02 20:51:39,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935159433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:39,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:39,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938848821] [2022-11-02 20:51:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:39,568 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2022-11-02 20:51:39,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 152 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:39,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:39,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2022-11-02 20:51:39,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:42,366 INFO L130 PetriNetUnfolder]: 5611/17681 cut-off events. [2022-11-02 20:51:42,366 INFO L131 PetriNetUnfolder]: For 1815/1815 co-relation queries the response was YES. [2022-11-02 20:51:42,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26264 conditions, 17681 events. 5611/17681 cut-off events. For 1815/1815 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 206764 event pairs, 3120 based on Foata normal form. 0/15577 useless extension candidates. Maximal degree in co-relation 26107. Up to 4331 conditions per place. [2022-11-02 20:51:42,590 INFO L137 encePairwiseOnDemand]: 164/168 looper letters, 36 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2022-11-02 20:51:42,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 166 transitions, 467 flow [2022-11-02 20:51:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-11-02 20:51:42,593 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8591269841269841 [2022-11-02 20:51:42,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-11-02 20:51:42,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-11-02 20:51:42,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:42,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-11-02 20:51:42,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,599 INFO L175 Difference]: Start difference. First operand has 151 places, 152 transitions, 341 flow. Second operand 3 states and 433 transitions. [2022-11-02 20:51:42,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 166 transitions, 467 flow [2022-11-02 20:51:42,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 166 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:42,613 INFO L231 Difference]: Finished difference. Result has 154 places, 153 transitions, 357 flow [2022-11-02 20:51:42,613 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=154, PETRI_TRANSITIONS=153} [2022-11-02 20:51:42,614 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -4 predicate places. [2022-11-02 20:51:42,614 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 153 transitions, 357 flow [2022-11-02 20:51:42,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:42,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:42,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:51:42,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash 48678837, now seen corresponding path program 1 times [2022-11-02 20:51:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338373695] [2022-11-02 20:51:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,673 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-02 20:51:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338373695] [2022-11-02 20:51:42,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338373695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:42,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:42,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924554619] [2022-11-02 20:51:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:42,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:42,676 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2022-11-02 20:51:42,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 153 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:42,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:42,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2022-11-02 20:51:42,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:45,259 INFO L130 PetriNetUnfolder]: 5058/16140 cut-off events. [2022-11-02 20:51:45,259 INFO L131 PetriNetUnfolder]: For 2866/2866 co-relation queries the response was YES. [2022-11-02 20:51:45,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24496 conditions, 16140 events. 5058/16140 cut-off events. For 2866/2866 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 186883 event pairs, 2796 based on Foata normal form. 242/14602 useless extension candidates. Maximal degree in co-relation 24344. Up to 3886 conditions per place. [2022-11-02 20:51:45,449 INFO L137 encePairwiseOnDemand]: 165/168 looper letters, 36 selfloop transitions, 1 changer transitions 0/164 dead transitions. [2022-11-02 20:51:45,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 164 transitions, 465 flow [2022-11-02 20:51:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-11-02 20:51:45,451 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-11-02 20:51:45,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-11-02 20:51:45,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-11-02 20:51:45,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:45,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-11-02 20:51:45,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,455 INFO L175 Difference]: Start difference. First operand has 154 places, 153 transitions, 357 flow. Second operand 3 states and 432 transitions. [2022-11-02 20:51:45,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 164 transitions, 465 flow [2022-11-02 20:51:45,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 164 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:45,466 INFO L231 Difference]: Finished difference. Result has 155 places, 151 transitions, 346 flow [2022-11-02 20:51:45,466 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=155, PETRI_TRANSITIONS=151} [2022-11-02 20:51:45,466 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -3 predicate places. [2022-11-02 20:51:45,467 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 346 flow [2022-11-02 20:51:45,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:45,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:45,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:51:45,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash 48677814, now seen corresponding path program 1 times [2022-11-02 20:51:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:45,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240984346] [2022-11-02 20:51:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:45,496 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-02 20:51:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:45,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240984346] [2022-11-02 20:51:45,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240984346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:45,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:45,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:45,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339396258] [2022-11-02 20:51:45,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:45,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:45,499 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2022-11-02 20:51:45,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:45,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:45,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2022-11-02 20:51:45,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:47,211 INFO L130 PetriNetUnfolder]: 3432/10702 cut-off events. [2022-11-02 20:51:47,211 INFO L131 PetriNetUnfolder]: For 1310/1310 co-relation queries the response was YES. [2022-11-02 20:51:47,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16387 conditions, 10702 events. 3432/10702 cut-off events. For 1310/1310 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 114747 event pairs, 1824 based on Foata normal form. 0/9546 useless extension candidates. Maximal degree in co-relation 14046. Up to 2551 conditions per place. [2022-11-02 20:51:47,510 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 32 selfloop transitions, 1 changer transitions 0/161 dead transitions. [2022-11-02 20:51:47,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 161 transitions, 447 flow [2022-11-02 20:51:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-02 20:51:47,513 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.876984126984127 [2022-11-02 20:51:47,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-02 20:51:47,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-02 20:51:47,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:47,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-02 20:51:47,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:47,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:47,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:47,516 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 346 flow. Second operand 3 states and 442 transitions. [2022-11-02 20:51:47,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 161 transitions, 447 flow [2022-11-02 20:51:47,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 161 transitions, 442 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:51:47,520 INFO L231 Difference]: Finished difference. Result has 152 places, 148 transitions, 332 flow [2022-11-02 20:51:47,521 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=152, PETRI_TRANSITIONS=148} [2022-11-02 20:51:47,521 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -6 predicate places. [2022-11-02 20:51:47,521 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 148 transitions, 332 flow [2022-11-02 20:51:47,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:47,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:47,522 INFO L208 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] [2022-11-02 20:51:47,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:51:47,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -985738109, now seen corresponding path program 1 times [2022-11-02 20:51:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:47,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135895162] [2022-11-02 20:51:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:47,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135895162] [2022-11-02 20:51:47,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135895162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:47,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:47,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954714364] [2022-11-02 20:51:47,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:47,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:47,557 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2022-11-02 20:51:47,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 148 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:47,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:47,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2022-11-02 20:51:47,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:50,899 INFO L130 PetriNetUnfolder]: 7568/21994 cut-off events. [2022-11-02 20:51:50,899 INFO L131 PetriNetUnfolder]: For 2197/2197 co-relation queries the response was YES. [2022-11-02 20:51:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33148 conditions, 21994 events. 7568/21994 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 260000 event pairs, 4284 based on Foata normal form. 0/18682 useless extension candidates. Maximal degree in co-relation 24581. Up to 5889 conditions per place. [2022-11-02 20:51:51,209 INFO L137 encePairwiseOnDemand]: 163/168 looper letters, 36 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2022-11-02 20:51:51,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 162 transitions, 453 flow [2022-11-02 20:51:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-11-02 20:51:51,212 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2022-11-02 20:51:51,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-11-02 20:51:51,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-11-02 20:51:51,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:51,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-11-02 20:51:51,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:51,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:51,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:51,216 INFO L175 Difference]: Start difference. First operand has 152 places, 148 transitions, 332 flow. Second operand 3 states and 434 transitions. [2022-11-02 20:51:51,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 162 transitions, 453 flow [2022-11-02 20:51:51,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 162 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:51,220 INFO L231 Difference]: Finished difference. Result has 155 places, 150 transitions, 355 flow [2022-11-02 20:51:51,221 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=155, PETRI_TRANSITIONS=150} [2022-11-02 20:51:51,221 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -3 predicate places. [2022-11-02 20:51:51,222 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 150 transitions, 355 flow [2022-11-02 20:51:51,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:51,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:51,222 INFO L208 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] [2022-11-02 20:51:51,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:51:51,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -985739132, now seen corresponding path program 1 times [2022-11-02 20:51:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520754528] [2022-11-02 20:51:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:51,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520754528] [2022-11-02 20:51:51,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520754528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:51,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:51,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631734203] [2022-11-02 20:51:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:51,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:51,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:51,259 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2022-11-02 20:51:51,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 150 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:51,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:51,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2022-11-02 20:51:51,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:53,972 INFO L130 PetriNetUnfolder]: 5568/16390 cut-off events. [2022-11-02 20:51:53,973 INFO L131 PetriNetUnfolder]: For 1945/1945 co-relation queries the response was YES. [2022-11-02 20:51:54,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25629 conditions, 16390 events. 5568/16390 cut-off events. For 1945/1945 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 185357 event pairs, 3396 based on Foata normal form. 0/14052 useless extension candidates. Maximal degree in co-relation 17867. Up to 4681 conditions per place. [2022-11-02 20:51:54,220 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 32 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2022-11-02 20:51:54,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 162 transitions, 458 flow [2022-11-02 20:51:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-02 20:51:54,223 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.876984126984127 [2022-11-02 20:51:54,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-02 20:51:54,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-02 20:51:54,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:54,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-02 20:51:54,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:54,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:54,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:54,227 INFO L175 Difference]: Start difference. First operand has 155 places, 150 transitions, 355 flow. Second operand 3 states and 442 transitions. [2022-11-02 20:51:54,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 162 transitions, 458 flow [2022-11-02 20:51:54,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 453 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:54,267 INFO L231 Difference]: Finished difference. Result has 157 places, 149 transitions, 351 flow [2022-11-02 20:51:54,268 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=157, PETRI_TRANSITIONS=149} [2022-11-02 20:51:54,268 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -1 predicate places. [2022-11-02 20:51:54,269 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 149 transitions, 351 flow [2022-11-02 20:51:54,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:54,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:54,269 INFO L208 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] [2022-11-02 20:51:54,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:51:54,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash -986691421, now seen corresponding path program 1 times [2022-11-02 20:51:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:54,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104014075] [2022-11-02 20:51:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:54,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104014075] [2022-11-02 20:51:54,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104014075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:54,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:54,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835917622] [2022-11-02 20:51:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:54,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:54,305 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2022-11-02 20:51:54,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 149 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:54,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:54,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2022-11-02 20:51:54,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:56,408 INFO L130 PetriNetUnfolder]: 4536/13446 cut-off events. [2022-11-02 20:51:56,408 INFO L131 PetriNetUnfolder]: For 1897/1897 co-relation queries the response was YES. [2022-11-02 20:51:56,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21158 conditions, 13446 events. 4536/13446 cut-off events. For 1897/1897 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 146988 event pairs, 2508 based on Foata normal form. 160/11840 useless extension candidates. Maximal degree in co-relation 13831. Up to 3473 conditions per place. [2022-11-02 20:51:56,605 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 31 selfloop transitions, 1 changer transitions 0/159 dead transitions. [2022-11-02 20:51:56,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 159 transitions, 445 flow [2022-11-02 20:51:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-02 20:51:56,607 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-11-02 20:51:56,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-02 20:51:56,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-02 20:51:56,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:56,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-02 20:51:56,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:56,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:56,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:56,611 INFO L175 Difference]: Start difference. First operand has 157 places, 149 transitions, 351 flow. Second operand 3 states and 441 transitions. [2022-11-02 20:51:56,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 159 transitions, 445 flow [2022-11-02 20:51:56,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 159 transitions, 438 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:51:56,639 INFO L231 Difference]: Finished difference. Result has 157 places, 147 transitions, 340 flow [2022-11-02 20:51:56,639 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=157, PETRI_TRANSITIONS=147} [2022-11-02 20:51:56,640 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -1 predicate places. [2022-11-02 20:51:56,640 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 147 transitions, 340 flow [2022-11-02 20:51:56,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:56,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:56,641 INFO L208 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] [2022-11-02 20:51:56,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:51:56,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:51:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash -986692444, now seen corresponding path program 1 times [2022-11-02 20:51:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:56,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191999063] [2022-11-02 20:51:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191999063] [2022-11-02 20:51:56,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191999063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:56,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:56,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387467508] [2022-11-02 20:51:56,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:56,674 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2022-11-02 20:51:56,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 147 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:56,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:56,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2022-11-02 20:51:56,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:59,773 INFO L130 PetriNetUnfolder]: 6240/18874 cut-off events. [2022-11-02 20:51:59,773 INFO L131 PetriNetUnfolder]: For 2045/2045 co-relation queries the response was YES. [2022-11-02 20:51:59,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28718 conditions, 18874 events. 6240/18874 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 221585 event pairs, 3840 based on Foata normal form. 0/16418 useless extension candidates. Maximal degree in co-relation 25019. Up to 5285 conditions per place. [2022-11-02 20:52:00,054 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 34 selfloop transitions, 1 changer transitions 0/157 dead transitions. [2022-11-02 20:52:00,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 444 flow [2022-11-02 20:52:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-11-02 20:52:00,057 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2022-11-02 20:52:00,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-11-02 20:52:00,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-11-02 20:52:00,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:00,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-11-02 20:52:00,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:00,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:00,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:00,062 INFO L175 Difference]: Start difference. First operand has 157 places, 147 transitions, 340 flow. Second operand 3 states and 429 transitions. [2022-11-02 20:52:00,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 157 transitions, 444 flow [2022-11-02 20:52:00,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 157 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:52:00,100 INFO L231 Difference]: Finished difference. Result has 156 places, 145 transitions, 336 flow [2022-11-02 20:52:00,100 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=156, PETRI_TRANSITIONS=145} [2022-11-02 20:52:00,101 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, -2 predicate places. [2022-11-02 20:52:00,101 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 336 flow [2022-11-02 20:52:00,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:00,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:00,102 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-11-02 20:52:00,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:52:00,102 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:52:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1012881655, now seen corresponding path program 1 times [2022-11-02 20:52:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:00,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080873298] [2022-11-02 20:52:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:00,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:52:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:00,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080873298] [2022-11-02 20:52:00,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080873298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:00,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:00,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506891386] [2022-11-02 20:52:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:00,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:00,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:00,141 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2022-11-02 20:52:00,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 145 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:00,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:00,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2022-11-02 20:52:00,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:02,605 INFO L130 PetriNetUnfolder]: 6812/16766 cut-off events. [2022-11-02 20:52:02,605 INFO L131 PetriNetUnfolder]: For 1981/1981 co-relation queries the response was YES. [2022-11-02 20:52:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26870 conditions, 16766 events. 6812/16766 cut-off events. For 1981/1981 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 176392 event pairs, 4020 based on Foata normal form. 0/13156 useless extension candidates. Maximal degree in co-relation 19901. Up to 5497 conditions per place. [2022-11-02 20:52:02,827 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 31 selfloop transitions, 1 changer transitions 0/157 dead transitions. [2022-11-02 20:52:02,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 157 transitions, 434 flow [2022-11-02 20:52:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-02 20:52:02,829 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-11-02 20:52:02,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-02 20:52:02,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-02 20:52:02,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:02,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-02 20:52:02,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:02,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:02,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:02,833 INFO L175 Difference]: Start difference. First operand has 156 places, 145 transitions, 336 flow. Second operand 3 states and 441 transitions. [2022-11-02 20:52:02,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 157 transitions, 434 flow [2022-11-02 20:52:02,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 157 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:52:02,837 INFO L231 Difference]: Finished difference. Result has 158 places, 145 transitions, 340 flow [2022-11-02 20:52:02,837 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=158, PETRI_TRANSITIONS=145} [2022-11-02 20:52:02,838 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, 0 predicate places. [2022-11-02 20:52:02,838 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 340 flow [2022-11-02 20:52:02,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:02,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:02,839 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-11-02 20:52:02,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:52:02,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:52:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1012882678, now seen corresponding path program 1 times [2022-11-02 20:52:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:02,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918188664] [2022-11-02 20:52:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:02,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:52:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918188664] [2022-11-02 20:52:02,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918188664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:02,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:02,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930447615] [2022-11-02 20:52:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:02,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:02,874 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2022-11-02 20:52:02,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 145 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:02,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:02,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2022-11-02 20:52:02,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:07,084 INFO L130 PetriNetUnfolder]: 10380/25502 cut-off events. [2022-11-02 20:52:07,084 INFO L131 PetriNetUnfolder]: For 3341/3341 co-relation queries the response was YES. [2022-11-02 20:52:07,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42071 conditions, 25502 events. 10380/25502 cut-off events. For 3341/3341 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 289305 event pairs, 5820 based on Foata normal form. 0/21288 useless extension candidates. Maximal degree in co-relation 37403. Up to 7921 conditions per place. [2022-11-02 20:52:07,474 INFO L137 encePairwiseOnDemand]: 164/168 looper letters, 34 selfloop transitions, 3 changer transitions 0/157 dead transitions. [2022-11-02 20:52:07,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 448 flow [2022-11-02 20:52:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-02 20:52:07,476 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8551587301587301 [2022-11-02 20:52:07,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-02 20:52:07,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-02 20:52:07,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:07,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-02 20:52:07,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:07,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:07,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:07,480 INFO L175 Difference]: Start difference. First operand has 158 places, 145 transitions, 340 flow. Second operand 3 states and 431 transitions. [2022-11-02 20:52:07,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 157 transitions, 448 flow [2022-11-02 20:52:07,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:52:07,523 INFO L231 Difference]: Finished difference. Result has 161 places, 146 transitions, 357 flow [2022-11-02 20:52:07,523 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=161, PETRI_TRANSITIONS=146} [2022-11-02 20:52:07,524 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, 3 predicate places. [2022-11-02 20:52:07,524 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 146 transitions, 357 flow [2022-11-02 20:52:07,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:07,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:07,525 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-11-02 20:52:07,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:52:07,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:52:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1011929366, now seen corresponding path program 1 times [2022-11-02 20:52:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137400218] [2022-11-02 20:52:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:52:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137400218] [2022-11-02 20:52:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137400218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283496072] [2022-11-02 20:52:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:07,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:07,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:07,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:07,571 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2022-11-02 20:52:07,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 146 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:07,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:07,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2022-11-02 20:52:07,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:10,186 INFO L130 PetriNetUnfolder]: 5796/15126 cut-off events. [2022-11-02 20:52:10,187 INFO L131 PetriNetUnfolder]: For 2317/2317 co-relation queries the response was YES. [2022-11-02 20:52:10,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25496 conditions, 15126 events. 5796/15126 cut-off events. For 2317/2317 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 161171 event pairs, 3420 based on Foata normal form. 208/12912 useless extension candidates. Maximal degree in co-relation 16859. Up to 4689 conditions per place. [2022-11-02 20:52:10,439 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 30 selfloop transitions, 1 changer transitions 0/155 dead transitions. [2022-11-02 20:52:10,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 155 transitions, 441 flow [2022-11-02 20:52:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2022-11-02 20:52:10,442 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2022-11-02 20:52:10,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2022-11-02 20:52:10,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2022-11-02 20:52:10,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:10,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2022-11-02 20:52:10,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,446 INFO L175 Difference]: Start difference. First operand has 161 places, 146 transitions, 357 flow. Second operand 3 states and 440 transitions. [2022-11-02 20:52:10,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 155 transitions, 441 flow [2022-11-02 20:52:10,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 155 transitions, 433 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:52:10,511 INFO L231 Difference]: Finished difference. Result has 161 places, 144 transitions, 344 flow [2022-11-02 20:52:10,511 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=161, PETRI_TRANSITIONS=144} [2022-11-02 20:52:10,512 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, 3 predicate places. [2022-11-02 20:52:10,512 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 144 transitions, 344 flow [2022-11-02 20:52:10,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:10,513 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-11-02 20:52:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:52:10,513 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:52:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1011928343, now seen corresponding path program 1 times [2022-11-02 20:52:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337363291] [2022-11-02 20:52:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:52:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337363291] [2022-11-02 20:52:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337363291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:10,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:10,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855123478] [2022-11-02 20:52:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:10,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:10,561 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2022-11-02 20:52:10,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 144 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:10,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2022-11-02 20:52:10,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:14,071 INFO L130 PetriNetUnfolder]: 7884/20462 cut-off events. [2022-11-02 20:52:14,072 INFO L131 PetriNetUnfolder]: For 2573/2573 co-relation queries the response was YES. [2022-11-02 20:52:14,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33528 conditions, 20462 events. 7884/20462 cut-off events. For 2573/2573 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 230006 event pairs, 5220 based on Foata normal form. 0/17336 useless extension candidates. Maximal degree in co-relation 28651. Up to 7113 conditions per place. [2022-11-02 20:52:14,343 INFO L137 encePairwiseOnDemand]: 166/168 looper letters, 33 selfloop transitions, 1 changer transitions 0/153 dead transitions. [2022-11-02 20:52:14,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 153 transitions, 439 flow [2022-11-02 20:52:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2022-11-02 20:52:14,345 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2022-11-02 20:52:14,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2022-11-02 20:52:14,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2022-11-02 20:52:14,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:14,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2022-11-02 20:52:14,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:14,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:14,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:14,349 INFO L175 Difference]: Start difference. First operand has 161 places, 144 transitions, 344 flow. Second operand 3 states and 428 transitions. [2022-11-02 20:52:14,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 153 transitions, 439 flow [2022-11-02 20:52:14,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 153 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:52:14,408 INFO L231 Difference]: Finished difference. Result has 160 places, 142 transitions, 340 flow [2022-11-02 20:52:14,409 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=160, PETRI_TRANSITIONS=142} [2022-11-02 20:52:14,409 INFO L287 CegarLoopForPetriNet]: 158 programPoint places, 2 predicate places. [2022-11-02 20:52:14,409 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 142 transitions, 340 flow [2022-11-02 20:52:14,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:14,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:14,410 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:14,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:52:14,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-02 20:52:14,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash -351366252, now seen corresponding path program 1 times [2022-11-02 20:52:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:14,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98611610] [2022-11-02 20:52:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:14,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:14,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:14,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:14,479 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:52:14,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-02 20:52:14,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 20:52:14,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-11-02 20:52:14,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-02 20:52:14,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-02 20:52:14,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-02 20:52:14,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 20:52:14,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:52:14,482 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:14,482 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:52:14,482 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-11-02 20:52:14,532 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:52:14,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 196 transitions, 452 flow [2022-11-02 20:52:14,571 INFO L130 PetriNetUnfolder]: 31/272 cut-off events. [2022-11-02 20:52:14,571 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-02 20:52:14,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 272 events. 31/272 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 759 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 250. Up to 14 conditions per place. [2022-11-02 20:52:14,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 196 transitions, 452 flow [2022-11-02 20:52:14,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 196 transitions, 452 flow [2022-11-02 20:52:14,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:14,579 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;@1433629d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:14,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-02 20:52:14,585 INFO L130 PetriNetUnfolder]: 6/86 cut-off events. [2022-11-02 20:52:14,586 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:52:14,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:14,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:14,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-02 20:52:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 81042965, now seen corresponding path program 1 times [2022-11-02 20:52:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:14,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393891046] [2022-11-02 20:52:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:14,616 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-02 20:52:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:14,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393891046] [2022-11-02 20:52:14,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393891046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:14,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:14,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:14,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677412688] [2022-11-02 20:52:14,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:14,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:14,620 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 196 [2022-11-02 20:52:14,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 196 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:14,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:14,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 196 [2022-11-02 20:52:14,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:21,901 INFO L130 PetriNetUnfolder]: 14261/41290 cut-off events. [2022-11-02 20:52:21,901 INFO L131 PetriNetUnfolder]: For 30511/30511 co-relation queries the response was YES. [2022-11-02 20:52:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67953 conditions, 41290 events. 14261/41290 cut-off events. For 30511/30511 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 521647 event pairs, 8142 based on Foata normal form. 9653/46016 useless extension candidates. Maximal degree in co-relation 18781. Up to 10691 conditions per place. [2022-11-02 20:52:22,669 INFO L137 encePairwiseOnDemand]: 186/196 looper letters, 39 selfloop transitions, 1 changer transitions 0/194 dead transitions. [2022-11-02 20:52:22,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 194 transitions, 573 flow [2022-11-02 20:52:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2022-11-02 20:52:22,671 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9081632653061225 [2022-11-02 20:52:22,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2022-11-02 20:52:22,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2022-11-02 20:52:22,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:22,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2022-11-02 20:52:22,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,675 INFO L175 Difference]: Start difference. First operand has 184 places, 196 transitions, 452 flow. Second operand 3 states and 534 transitions. [2022-11-02 20:52:22,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 194 transitions, 573 flow [2022-11-02 20:52:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 194 transitions, 523 flow, removed 25 selfloop flow, removed 0 redundant places. [2022-11-02 20:52:22,711 INFO L231 Difference]: Finished difference. Result has 175 places, 177 transitions, 389 flow [2022-11-02 20:52:22,712 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=175, PETRI_TRANSITIONS=177} [2022-11-02 20:52:22,712 INFO L287 CegarLoopForPetriNet]: 184 programPoint places, -9 predicate places. [2022-11-02 20:52:22,712 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 177 transitions, 389 flow [2022-11-02 20:52:22,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:22,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:52:22,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-02 20:52:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 81043988, now seen corresponding path program 1 times [2022-11-02 20:52:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:22,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754704467] [2022-11-02 20:52:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:22,739 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-02 20:52:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:22,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754704467] [2022-11-02 20:52:22,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754704467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:22,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:22,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252300748] [2022-11-02 20:52:22,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:22,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:22,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:22,742 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2022-11-02 20:52:22,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 177 transitions, 389 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:22,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2022-11-02 20:52:22,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand