./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a --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 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- 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-b5237d8 [2022-11-21 16:28:48,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:28:48,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:28:48,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:28:48,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:28:48,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:28:48,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:28:48,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:28:48,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:28:48,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:28:48,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:28:48,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:28:48,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:28:48,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:28:48,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:28:48,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:28:48,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:28:48,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:28:48,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:28:48,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:28:48,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:28:48,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:28:48,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:28:48,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:28:48,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:28:48,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:28:48,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:28:48,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:28:48,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:28:48,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:28:48,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:28:48,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:28:48,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:28:48,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:28:48,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:28:48,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:28:48,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:28:48,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:28:48,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:28:48,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:28:48,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:28:48,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:28:48,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:28:48,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:28:48,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:28:48,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:28:48,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:28:48,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:28:48,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:28:48,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:28:48,495 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:28:48,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:28:48,496 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:28:48,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:28:48,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:28:48,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:28:48,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:28:48,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:28:48,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:28:48,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:28:48,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:28:48,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:28:48,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:28:48,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:28:48,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:28:48,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:28:48,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:28:48,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:28:48,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:28:48,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:28:48,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:28:48,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:28:48,501 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:28:48,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:28:48,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:28:48,502 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_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/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_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a 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 -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2022-11-21 16:28:48,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:28:48,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:28:48,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:28:48,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:28:48,847 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:28:48,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-21 16:28:51,891 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:28:52,224 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:28:52,225 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-11-21 16:28:52,243 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/data/16f246b87/ab2393a7d18845d9b675c1e9663889df/FLAG6279e2c84 [2022-11-21 16:28:52,263 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/data/16f246b87/ab2393a7d18845d9b675c1e9663889df [2022-11-21 16:28:52,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:28:52,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:28:52,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:28:52,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:28:52,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:28:52,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:28:52" (1/1) ... [2022-11-21 16:28:52,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7216aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:52, skipping insertion in model container [2022-11-21 16:28:52,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:28:52" (1/1) ... [2022-11-21 16:28:52,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:28:52,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:28:52,900 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-21 16:28:52,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:28:52,963 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:28:52,998 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-11-21 16:28:53,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:28:53,074 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:28:53,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53 WrapperNode [2022-11-21 16:28:53,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:28:53,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:28:53,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:28:53,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:28:53,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,133 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 201 [2022-11-21 16:28:53,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:28:53,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:28:53,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:28:53,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:28:53,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,202 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:28:53,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:28:53,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:28:53,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:28:53,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (1/1) ... [2022-11-21 16:28:53,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:28:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:28:53,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:28:53,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:28:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:28:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:28:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:28:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:28:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 16:28:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:28:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-21 16:28:53,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-21 16:28:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:28:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:28:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:28:53,307 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:28:53,517 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:28:53,519 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:28:53,903 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:28:53,917 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:28:53,918 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-21 16:28:53,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:28:53 BoogieIcfgContainer [2022-11-21 16:28:53,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:28:53,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:28:53,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:28:53,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:28:53,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:28:52" (1/3) ... [2022-11-21 16:28:53,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74232b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:28:53, skipping insertion in model container [2022-11-21 16:28:53,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:28:53" (2/3) ... [2022-11-21 16:28:53,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74232b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:28:53, skipping insertion in model container [2022-11-21 16:28:53,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:28:53" (3/3) ... [2022-11-21 16:28:53,931 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-11-21 16:28:53,940 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:28:53,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:28:53,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:28:53,952 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:28:54,043 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-21 16:28:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 206 transitions, 420 flow [2022-11-21 16:28:54,186 INFO L130 PetriNetUnfolder]: 43/278 cut-off events. [2022-11-21 16:28:54,192 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:28:54,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 278 events. 43/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 860 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2022-11-21 16:28:54,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 206 transitions, 420 flow [2022-11-21 16:28:54,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 199 transitions, 403 flow [2022-11-21 16:28:54,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:28:54,238 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;@73642ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:28:54,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 16:28:54,274 INFO L130 PetriNetUnfolder]: 14/162 cut-off events. [2022-11-21 16:28:54,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:28:54,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:54,276 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:54,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-21 16:28:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash 682234352, now seen corresponding path program 1 times [2022-11-21 16:28:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:54,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307035858] [2022-11-21 16:28:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:54,591 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-21 16:28:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:54,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307035858] [2022-11-21 16:28:54,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307035858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:54,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:54,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:28:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047010483] [2022-11-21 16:28:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:54,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:28:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:28:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:28:54,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 206 [2022-11-21 16:28:54,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 199 transitions, 403 flow. Second operand has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:54,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:54,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 206 [2022-11-21 16:28:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:54,726 INFO L130 PetriNetUnfolder]: 4/231 cut-off events. [2022-11-21 16:28:54,727 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:28:54,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 231 events. 4/231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 37/257 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2022-11-21 16:28:54,730 INFO L137 encePairwiseOnDemand]: 182/206 looper letters, 1 selfloop transitions, 0 changer transitions 0/173 dead transitions. [2022-11-21 16:28:54,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 353 flow [2022-11-21 16:28:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:28:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:28:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 381 transitions. [2022-11-21 16:28:54,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9247572815533981 [2022-11-21 16:28:54,746 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 381 transitions. [2022-11-21 16:28:54,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 381 transitions. [2022-11-21 16:28:54,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:54,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 381 transitions. [2022-11-21 16:28:54,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 190.5) internal successors, (381), 2 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:54,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:54,761 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:54,763 INFO L175 Difference]: Start difference. First operand has 175 places, 199 transitions, 403 flow. Second operand 2 states and 381 transitions. [2022-11-21 16:28:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 353 flow [2022-11-21 16:28:54,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:28:54,773 INFO L231 Difference]: Finished difference. Result has 174 places, 173 transitions, 351 flow [2022-11-21 16:28:54,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=351, PETRI_PLACES=174, PETRI_TRANSITIONS=173} [2022-11-21 16:28:54,779 INFO L288 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2022-11-21 16:28:54,780 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 173 transitions, 351 flow [2022-11-21 16:28:54,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:54,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:54,781 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:54,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:28:54,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-21 16:28:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2105181135, now seen corresponding path program 1 times [2022-11-21 16:28:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:54,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823812150] [2022-11-21 16:28:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:55,018 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-21 16:28:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:55,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823812150] [2022-11-21 16:28:55,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823812150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:55,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:55,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:28:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565045812] [2022-11-21 16:28:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:55,023 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2022-11-21 16:28:55,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 173 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:55,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2022-11-21 16:28:55,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:55,090 INFO L130 PetriNetUnfolder]: 3/177 cut-off events. [2022-11-21 16:28:55,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:28:55,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 177 events. 3/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 295 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 190. Up to 6 conditions per place. [2022-11-21 16:28:55,093 INFO L137 encePairwiseOnDemand]: 203/206 looper letters, 8 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-21 16:28:55,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 175 transitions, 375 flow [2022-11-21 16:28:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:28:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-11-21 16:28:55,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478964401294499 [2022-11-21 16:28:55,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-11-21 16:28:55,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-11-21 16:28:55,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:55,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-11-21 16:28:55,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,111 INFO L175 Difference]: Start difference. First operand has 174 places, 173 transitions, 351 flow. Second operand 3 states and 524 transitions. [2022-11-21 16:28:55,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 175 transitions, 375 flow [2022-11-21 16:28:55,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 175 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:28:55,119 INFO L231 Difference]: Finished difference. Result has 177 places, 173 transitions, 359 flow [2022-11-21 16:28:55,119 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2022-11-21 16:28:55,120 INFO L288 CegarLoopForPetriNet]: 175 programPoint places, 2 predicate places. [2022-11-21 16:28:55,120 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 359 flow [2022-11-21 16:28:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,121 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:55,121 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:55,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:28:55,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-21 16:28:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash 758021973, now seen corresponding path program 1 times [2022-11-21 16:28:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:55,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459017946] [2022-11-21 16:28:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:28:55,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:28:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:28:55,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:28:55,218 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:28:55,219 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-21 16:28:55,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-21 16:28:55,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-21 16:28:55,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-21 16:28:55,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:28:55,222 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-21 16:28:55,225 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 16:28:55,225 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-21 16:28:55,277 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 16:28:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 266 transitions, 550 flow [2022-11-21 16:28:55,353 INFO L130 PetriNetUnfolder]: 72/435 cut-off events. [2022-11-21 16:28:55,353 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-21 16:28:55,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 435 events. 72/435 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1664 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 280. Up to 12 conditions per place. [2022-11-21 16:28:55,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 266 transitions, 550 flow [2022-11-21 16:28:55,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 264 transitions, 546 flow [2022-11-21 16:28:55,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:28:55,367 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;@73642ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:28:55,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-21 16:28:55,388 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-21 16:28:55,388 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:28:55,388 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:55,388 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:55,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-21 16:28:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash -631775504, now seen corresponding path program 1 times [2022-11-21 16:28:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:55,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788022507] [2022-11-21 16:28:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:55,436 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-21 16:28:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788022507] [2022-11-21 16:28:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788022507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:55,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:55,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:28:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049552678] [2022-11-21 16:28:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:55,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:28:55,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:55,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:28:55,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:28:55,439 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 266 [2022-11-21 16:28:55,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 264 transitions, 546 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:55,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 266 [2022-11-21 16:28:55,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:55,528 INFO L130 PetriNetUnfolder]: 9/366 cut-off events. [2022-11-21 16:28:55,528 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-21 16:28:55,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 366 events. 9/366 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1346 event pairs, 0 based on Foata normal form. 88/436 useless extension candidates. Maximal degree in co-relation 240. Up to 7 conditions per place. [2022-11-21 16:28:55,532 INFO L137 encePairwiseOnDemand]: 231/266 looper letters, 4 selfloop transitions, 0 changer transitions 0/226 dead transitions. [2022-11-21 16:28:55,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 226 transitions, 478 flow [2022-11-21 16:28:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:28:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:28:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 487 transitions. [2022-11-21 16:28:55,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9154135338345865 [2022-11-21 16:28:55,535 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 487 transitions. [2022-11-21 16:28:55,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 487 transitions. [2022-11-21 16:28:55,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:55,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 487 transitions. [2022-11-21 16:28:55,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,539 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,540 INFO L175 Difference]: Start difference. First operand has 228 places, 264 transitions, 546 flow. Second operand 2 states and 487 transitions. [2022-11-21 16:28:55,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 226 transitions, 478 flow [2022-11-21 16:28:55,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:28:55,545 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 470 flow [2022-11-21 16:28:55,546 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=470, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2022-11-21 16:28:55,546 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2022-11-21 16:28:55,547 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 470 flow [2022-11-21 16:28:55,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,548 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:55,548 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:55,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:28:55,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-21 16:28:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash 875776305, now seen corresponding path program 1 times [2022-11-21 16:28:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:55,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899078457] [2022-11-21 16:28:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:55,628 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-21 16:28:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:55,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899078457] [2022-11-21 16:28:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899078457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:55,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:55,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:28:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809166914] [2022-11-21 16:28:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:55,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:55,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 266 [2022-11-21 16:28:55,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:55,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 266 [2022-11-21 16:28:55,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:55,738 INFO L130 PetriNetUnfolder]: 7/321 cut-off events. [2022-11-21 16:28:55,739 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-21 16:28:55,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 321 events. 7/321 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1021 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 352. Up to 16 conditions per place. [2022-11-21 16:28:55,742 INFO L137 encePairwiseOnDemand]: 263/266 looper letters, 13 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-21 16:28:55,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 508 flow [2022-11-21 16:28:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:28:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-11-21 16:28:55,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358395989974937 [2022-11-21 16:28:55,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-11-21 16:28:55,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-11-21 16:28:55,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:55,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-11-21 16:28:55,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,751 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 470 flow. Second operand 3 states and 667 transitions. [2022-11-21 16:28:55,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 508 flow [2022-11-21 16:28:55,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:28:55,756 INFO L231 Difference]: Finished difference. Result has 229 places, 227 transitions, 482 flow [2022-11-21 16:28:55,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2022-11-21 16:28:55,758 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2022-11-21 16:28:55,758 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 482 flow [2022-11-21 16:28:55,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:55,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:55,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:55,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:28:55,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-21 16:28:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash 524199786, now seen corresponding path program 1 times [2022-11-21 16:28:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:55,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891540097] [2022-11-21 16:28:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:28:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:56,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891540097] [2022-11-21 16:28:56,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891540097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:56,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:56,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:28:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026054009] [2022-11-21 16:28:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:56,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:28:56,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:56,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:28:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:28:56,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 266 [2022-11-21 16:28:56,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 482 flow. Second operand has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:56,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:56,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 266 [2022-11-21 16:28:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:58,889 INFO L130 PetriNetUnfolder]: 2312/8970 cut-off events. [2022-11-21 16:28:58,890 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-11-21 16:28:58,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12947 conditions, 8970 events. 2312/8970 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 104413 event pairs, 475 based on Foata normal form. 0/8640 useless extension candidates. Maximal degree in co-relation 12940. Up to 1413 conditions per place. [2022-11-21 16:28:58,949 INFO L137 encePairwiseOnDemand]: 251/266 looper letters, 183 selfloop transitions, 44 changer transitions 62/453 dead transitions. [2022-11-21 16:28:58,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 453 transitions, 1576 flow [2022-11-21 16:28:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:28:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-21 16:28:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4253 transitions. [2022-11-21 16:28:58,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6661967418546366 [2022-11-21 16:28:58,959 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4253 transitions. [2022-11-21 16:28:58,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4253 transitions. [2022-11-21 16:28:58,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:58,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4253 transitions. [2022-11-21 16:28:58,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 177.20833333333334) internal successors, (4253), 24 states have internal predecessors, (4253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:58,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 266.0) internal successors, (6650), 25 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:58,988 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 266.0) internal successors, (6650), 25 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:58,988 INFO L175 Difference]: Start difference. First operand has 229 places, 227 transitions, 482 flow. Second operand 24 states and 4253 transitions. [2022-11-21 16:28:58,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 453 transitions, 1576 flow [2022-11-21 16:28:58,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 453 transitions, 1574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:28:58,999 INFO L231 Difference]: Finished difference. Result has 262 places, 275 transitions, 777 flow [2022-11-21 16:28:59,000 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=777, PETRI_PLACES=262, PETRI_TRANSITIONS=275} [2022-11-21 16:28:59,002 INFO L288 CegarLoopForPetriNet]: 228 programPoint places, 34 predicate places. [2022-11-21 16:28:59,002 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 275 transitions, 777 flow [2022-11-21 16:28:59,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:59,004 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:59,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:28:59,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-21 16:28:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1589778799, now seen corresponding path program 1 times [2022-11-21 16:28:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:59,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108848407] [2022-11-21 16:28:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:28:59,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:28:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:28:59,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:28:59,056 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:28:59,056 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-21 16:28:59,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-21 16:28:59,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-21 16:28:59,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-21 16:28:59,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-21 16:28:59,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:28:59,058 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-21 16:28:59,059 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 16:28:59,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-21 16:28:59,093 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 16:28:59,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 326 transitions, 682 flow [2022-11-21 16:28:59,281 INFO L130 PetriNetUnfolder]: 106/625 cut-off events. [2022-11-21 16:28:59,282 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-21 16:28:59,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 625 events. 106/625 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2628 event pairs, 1 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 443. Up to 16 conditions per place. [2022-11-21 16:28:59,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 326 transitions, 682 flow [2022-11-21 16:28:59,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 324 transitions, 678 flow [2022-11-21 16:28:59,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:28:59,307 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;@73642ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:28:59,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 16:28:59,326 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-21 16:28:59,328 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:28:59,328 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:59,329 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:59,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-21 16:28:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 438139376, now seen corresponding path program 1 times [2022-11-21 16:28:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:59,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730394673] [2022-11-21 16:28:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:59,393 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-21 16:28:59,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:59,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730394673] [2022-11-21 16:28:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730394673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:59,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:59,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:28:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431971896] [2022-11-21 16:28:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:59,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:28:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:28:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:28:59,406 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 326 [2022-11-21 16:28:59,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 324 transitions, 678 flow. Second operand has 2 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:59,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 326 [2022-11-21 16:28:59,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:59,537 INFO L130 PetriNetUnfolder]: 16/527 cut-off events. [2022-11-21 16:28:59,537 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-21 16:28:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 527 events. 16/527 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2255 event pairs, 1 based on Foata normal form. 205/705 useless extension candidates. Maximal degree in co-relation 380. Up to 16 conditions per place. [2022-11-21 16:28:59,547 INFO L137 encePairwiseOnDemand]: 280/326 looper letters, 6 selfloop transitions, 0 changer transitions 0/274 dead transitions. [2022-11-21 16:28:59,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 274 transitions, 590 flow [2022-11-21 16:28:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:28:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:28:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 592 transitions. [2022-11-21 16:28:59,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9079754601226994 [2022-11-21 16:28:59,551 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 592 transitions. [2022-11-21 16:28:59,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 592 transitions. [2022-11-21 16:28:59,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:59,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 592 transitions. [2022-11-21 16:28:59,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 296.0) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,556 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,557 INFO L175 Difference]: Start difference. First operand has 277 places, 324 transitions, 678 flow. Second operand 2 states and 592 transitions. [2022-11-21 16:28:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 274 transitions, 590 flow [2022-11-21 16:28:59,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 274 transitions, 590 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:28:59,563 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 578 flow [2022-11-21 16:28:59,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=578, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2022-11-21 16:28:59,566 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, -3 predicate places. [2022-11-21 16:28:59,566 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 578 flow [2022-11-21 16:28:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,567 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:59,567 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:59,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:28:59,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-21 16:28:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1945691185, now seen corresponding path program 1 times [2022-11-21 16:28:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:59,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841766188] [2022-11-21 16:28:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:28:59,633 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-21 16:28:59,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:28:59,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841766188] [2022-11-21 16:28:59,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841766188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:28:59,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:28:59,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:28:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151198384] [2022-11-21 16:28:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:28:59,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:28:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:28:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:28:59,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:28:59,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 326 [2022-11-21 16:28:59,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:28:59,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 326 [2022-11-21 16:28:59,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:28:59,789 INFO L130 PetriNetUnfolder]: 14/482 cut-off events. [2022-11-21 16:28:59,789 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-11-21 16:28:59,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 482 events. 14/482 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1934 event pairs, 1 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 540. Up to 30 conditions per place. [2022-11-21 16:28:59,800 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 15 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2022-11-21 16:28:59,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 278 transitions, 620 flow [2022-11-21 16:28:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:28:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:28:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2022-11-21 16:28:59,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8251533742331288 [2022-11-21 16:28:59,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2022-11-21 16:28:59,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2022-11-21 16:28:59,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:28:59,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2022-11-21 16:28:59,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,809 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 578 flow. Second operand 3 states and 807 transitions. [2022-11-21 16:28:59,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 278 transitions, 620 flow [2022-11-21 16:28:59,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:28:59,815 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 590 flow [2022-11-21 16:28:59,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2022-11-21 16:28:59,817 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 0 predicate places. [2022-11-21 16:28:59,817 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 590 flow [2022-11-21 16:28:59,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:28:59,818 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:28:59,818 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:28:59,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:28:59,818 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-21 16:28:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:28:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1844685738, now seen corresponding path program 1 times [2022-11-21 16:28:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:28:59,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228992965] [2022-11-21 16:28:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:28:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:28:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:29:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228992965] [2022-11-21 16:29:00,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228992965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:00,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:00,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:29:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165189400] [2022-11-21 16:29:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:00,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:29:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:29:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:29:00,139 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 326 [2022-11-21 16:29:00,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 275 transitions, 590 flow. Second operand has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:00,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:29:00,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 326 [2022-11-21 16:29:00,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:29:11,954 INFO L130 PetriNetUnfolder]: 23326/69220 cut-off events. [2022-11-21 16:29:11,955 INFO L131 PetriNetUnfolder]: For 2523/2523 co-relation queries the response was YES. [2022-11-21 16:29:12,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104103 conditions, 69220 events. 23326/69220 cut-off events. For 2523/2523 co-relation queries the response was YES. Maximal size of possible extension queue 2856. Compared 984351 event pairs, 6316 based on Foata normal form. 0/66920 useless extension candidates. Maximal degree in co-relation 104095. Up to 13347 conditions per place. [2022-11-21 16:29:12,665 INFO L137 encePairwiseOnDemand]: 310/326 looper letters, 343 selfloop transitions, 58 changer transitions 0/606 dead transitions. [2022-11-21 16:29:12,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 606 transitions, 2218 flow [2022-11-21 16:29:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:29:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-21 16:29:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5349 transitions. [2022-11-21 16:29:12,679 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6836656441717791 [2022-11-21 16:29:12,680 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5349 transitions. [2022-11-21 16:29:12,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5349 transitions. [2022-11-21 16:29:12,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:29:12,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5349 transitions. [2022-11-21 16:29:12,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 222.875) internal successors, (5349), 24 states have internal predecessors, (5349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:12,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 326.0) internal successors, (8150), 25 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:12,716 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 326.0) internal successors, (8150), 25 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:12,717 INFO L175 Difference]: Start difference. First operand has 277 places, 275 transitions, 590 flow. Second operand 24 states and 5349 transitions. [2022-11-21 16:29:12,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 606 transitions, 2218 flow [2022-11-21 16:29:12,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 606 transitions, 2216 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:29:12,733 INFO L231 Difference]: Finished difference. Result has 313 places, 336 transitions, 1010 flow [2022-11-21 16:29:12,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1010, PETRI_PLACES=313, PETRI_TRANSITIONS=336} [2022-11-21 16:29:12,737 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 36 predicate places. [2022-11-21 16:29:12,737 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 336 transitions, 1010 flow [2022-11-21 16:29:12,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:12,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:29:12,739 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:29:12,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:29:12,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-21 16:29:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash -810019150, now seen corresponding path program 1 times [2022-11-21 16:29:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:12,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158035217] [2022-11-21 16:29:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:29:12,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:12,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158035217] [2022-11-21 16:29:12,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158035217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:12,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619723271] [2022-11-21 16:29:12,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:12,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:29:12,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:29:12,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:29:12,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:29:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:13,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:29:13,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:29:13,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:29:13,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619723271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:29:13,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:29:13,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 16:29:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582050127] [2022-11-21 16:29:13,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:29:13,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:29:13,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:29:13,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:29:13,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 326 [2022-11-21 16:29:13,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 336 transitions, 1010 flow. Second operand has 10 states, 10 states have (on average 264.3) internal successors, (2643), 10 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:13,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:29:13,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 326 [2022-11-21 16:29:13,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:29:14,339 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1296] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][307], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 170#L1040-5true, 292#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 308#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 39#t_funENTRYtrue, Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 300#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 291#(= |~#B~0.base| 5), Black: 318#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 293#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5))]) [2022-11-21 16:29:14,339 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is not cut-off event [2022-11-21 16:29:14,339 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is not cut-off event [2022-11-21 16:29:14,339 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is not cut-off event [2022-11-21 16:29:14,340 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-11-21 16:29:14,397 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1296] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][307], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 170#L1040-5true, 292#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), 3#L1013-8true, 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 308#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 300#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 291#(= |~#B~0.base| 5), Black: 318#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 293#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5))]) [2022-11-21 16:29:14,398 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is not cut-off event [2022-11-21 16:29:14,398 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-21 16:29:14,398 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-11-21 16:29:14,398 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-11-21 16:29:14,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1296] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][307], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 205#L1013-34true, 170#L1040-5true, 320#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 308#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 292#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 300#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 291#(= |~#B~0.base| 5), Black: 318#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 293#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5))]) [2022-11-21 16:29:14,410 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is not cut-off event [2022-11-21 16:29:14,410 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is not cut-off event [2022-11-21 16:29:14,410 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-11-21 16:29:14,410 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-21 16:29:14,439 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1296] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][307], [281#true, Black: 286#(= |ULTIMATE.start_main_~i~0#1| 0), 170#L1040-5true, 320#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 352#true, Black: 326#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0NotInUse, Black: 308#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 322#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 314#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 292#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 302#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 304#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 300#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 328#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 306#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 334#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 291#(= |~#B~0.base| 5), Black: 318#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 293#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5))]) [2022-11-21 16:29:14,440 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-11-21 16:29:14,440 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 16:29:14,440 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-21 16:29:14,440 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-21 16:29:14,452 INFO L130 PetriNetUnfolder]: 578/4376 cut-off events. [2022-11-21 16:29:14,452 INFO L131 PetriNetUnfolder]: For 7486/8269 co-relation queries the response was YES. [2022-11-21 16:29:14,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8778 conditions, 4376 events. 578/4376 cut-off events. For 7486/8269 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 44107 event pairs, 139 based on Foata normal form. 36/4171 useless extension candidates. Maximal degree in co-relation 8756. Up to 505 conditions per place. [2022-11-21 16:29:14,545 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 16 selfloop transitions, 9 changer transitions 0/346 dead transitions. [2022-11-21 16:29:14,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 346 transitions, 1082 flow [2022-11-21 16:29:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:29:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:29:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2385 transitions. [2022-11-21 16:29:14,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2022-11-21 16:29:14,551 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2385 transitions. [2022-11-21 16:29:14,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2385 transitions. [2022-11-21 16:29:14,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:29:14,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2385 transitions. [2022-11-21 16:29:14,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:14,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:14,566 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:14,566 INFO L175 Difference]: Start difference. First operand has 313 places, 336 transitions, 1010 flow. Second operand 9 states and 2385 transitions. [2022-11-21 16:29:14,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 346 transitions, 1082 flow [2022-11-21 16:29:14,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 346 transitions, 1081 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:29:14,614 INFO L231 Difference]: Finished difference. Result has 323 places, 342 transitions, 1059 flow [2022-11-21 16:29:14,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1059, PETRI_PLACES=323, PETRI_TRANSITIONS=342} [2022-11-21 16:29:14,616 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 46 predicate places. [2022-11-21 16:29:14,616 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 342 transitions, 1059 flow [2022-11-21 16:29:14,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 264.3) internal successors, (2643), 10 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:14,625 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:29:14,626 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:14,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:14,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:29:14,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-21 16:29:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -755215180, now seen corresponding path program 1 times [2022-11-21 16:29:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292344228] [2022-11-21 16:29:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:29:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292344228] [2022-11-21 16:29:15,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292344228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:29:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402308199] [2022-11-21 16:29:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:29:15,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:29:15,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:29:15,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:29:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:15,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 16:29:15,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:29:15,731 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:29:15,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:29:15,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:29:15,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:29:15,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:29:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:29:16,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:29:16,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-21 16:29:16,576 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 16:29:16,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-21 16:29:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:29:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402308199] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:29:16,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:29:16,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-11-21 16:29:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878400955] [2022-11-21 16:29:16,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:29:16,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 16:29:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 16:29:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=190, Unknown=3, NotChecked=0, Total=240 [2022-11-21 16:29:16,593 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 326 [2022-11-21 16:29:16,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 342 transitions, 1059 flow. Second operand has 16 states, 16 states have (on average 209.9375) internal successors, (3359), 16 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:16,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:29:16,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 326 [2022-11-21 16:29:16,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:29:38,751 INFO L130 PetriNetUnfolder]: 36258/113452 cut-off events. [2022-11-21 16:29:38,751 INFO L131 PetriNetUnfolder]: For 216353/217182 co-relation queries the response was YES. [2022-11-21 16:29:40,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240187 conditions, 113452 events. 36258/113452 cut-off events. For 216353/217182 co-relation queries the response was YES. Maximal size of possible extension queue 4861. Compared 1761097 event pairs, 9925 based on Foata normal form. 171/108866 useless extension candidates. Maximal degree in co-relation 240163. Up to 19230 conditions per place. [2022-11-21 16:29:40,365 INFO L137 encePairwiseOnDemand]: 310/326 looper letters, 355 selfloop transitions, 160 changer transitions 20/763 dead transitions. [2022-11-21 16:29:40,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 763 transitions, 4071 flow [2022-11-21 16:29:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:29:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-21 16:29:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5345 transitions. [2022-11-21 16:29:40,378 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6831543967280164 [2022-11-21 16:29:40,378 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5345 transitions. [2022-11-21 16:29:40,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5345 transitions. [2022-11-21 16:29:40,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:29:40,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5345 transitions. [2022-11-21 16:29:40,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 222.70833333333334) internal successors, (5345), 24 states have internal predecessors, (5345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:40,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 326.0) internal successors, (8150), 25 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:40,409 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 326.0) internal successors, (8150), 25 states have internal predecessors, (8150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:40,409 INFO L175 Difference]: Start difference. First operand has 323 places, 342 transitions, 1059 flow. Second operand 24 states and 5345 transitions. [2022-11-21 16:29:40,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 763 transitions, 4071 flow [2022-11-21 16:29:41,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 763 transitions, 4065 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-21 16:29:41,680 INFO L231 Difference]: Finished difference. Result has 353 places, 463 transitions, 2130 flow [2022-11-21 16:29:41,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2130, PETRI_PLACES=353, PETRI_TRANSITIONS=463} [2022-11-21 16:29:41,682 INFO L288 CegarLoopForPetriNet]: 277 programPoint places, 76 predicate places. [2022-11-21 16:29:41,682 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 463 transitions, 2130 flow [2022-11-21 16:29:41,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 209.9375) internal successors, (3359), 16 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:41,683 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:29:41,684 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:29:41,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:29:41,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ef5323-b6ce-4009-a92b-f0a1f5275835/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 16:29:41,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-21 16:29:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -745850366, now seen corresponding path program 1 times [2022-11-21 16:29:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:41,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069939473] [2022-11-21 16:29:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:29:41,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:29:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:29:41,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:29:41,938 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:29:41,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-21 16:29:41,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 16:29:41,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-21 16:29:41,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-21 16:29:41,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-21 16:29:41,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 16:29:41,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:29:41,939 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-21 16:29:41,940 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 16:29:41,940 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-21 16:29:41,977 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-21 16:29:41,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 386 transitions, 816 flow [2022-11-21 16:29:42,138 INFO L130 PetriNetUnfolder]: 152/883 cut-off events. [2022-11-21 16:29:42,139 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-21 16:29:42,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 883 events. 152/883 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4007 event pairs, 6 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 645. Up to 32 conditions per place. [2022-11-21 16:29:42,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 386 transitions, 816 flow [2022-11-21 16:29:42,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 384 transitions, 812 flow [2022-11-21 16:29:42,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:29:42,172 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;@73642ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:29:42,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-21 16:29:42,185 INFO L130 PetriNetUnfolder]: 16/173 cut-off events. [2022-11-21 16:29:42,185 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:29:42,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:29:42,185 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:29:42,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-21 16:29:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash -402988304, now seen corresponding path program 1 times [2022-11-21 16:29:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:42,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554746585] [2022-11-21 16:29:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:42,213 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-21 16:29:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:42,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554746585] [2022-11-21 16:29:42,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554746585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:42,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:42,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:29:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074247476] [2022-11-21 16:29:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:42,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:29:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:42,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:29:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:29:42,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 386 [2022-11-21 16:29:42,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 384 transitions, 812 flow. Second operand has 2 states, 2 states have (on average 316.5) internal successors, (633), 2 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:29:42,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 386 [2022-11-21 16:29:42,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:29:42,382 INFO L130 PetriNetUnfolder]: 31/752 cut-off events. [2022-11-21 16:29:42,382 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-11-21 16:29:42,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 752 events. 31/752 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3545 event pairs, 6 based on Foata normal form. 469/1181 useless extension candidates. Maximal degree in co-relation 562. Up to 37 conditions per place. [2022-11-21 16:29:42,396 INFO L137 encePairwiseOnDemand]: 329/386 looper letters, 8 selfloop transitions, 0 changer transitions 0/322 dead transitions. [2022-11-21 16:29:42,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 322 transitions, 704 flow [2022-11-21 16:29:42,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:29:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:29:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 697 transitions. [2022-11-21 16:29:42,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9028497409326425 [2022-11-21 16:29:42,399 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 697 transitions. [2022-11-21 16:29:42,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 697 transitions. [2022-11-21 16:29:42,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:29:42,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 697 transitions. [2022-11-21 16:29:42,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 348.5) internal successors, (697), 2 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,404 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,404 INFO L175 Difference]: Start difference. First operand has 326 places, 384 transitions, 812 flow. Second operand 2 states and 697 transitions. [2022-11-21 16:29:42,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 322 transitions, 704 flow [2022-11-21 16:29:42,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 322 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:29:42,410 INFO L231 Difference]: Finished difference. Result has 322 places, 322 transitions, 688 flow [2022-11-21 16:29:42,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=386, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=688, PETRI_PLACES=322, PETRI_TRANSITIONS=322} [2022-11-21 16:29:42,412 INFO L288 CegarLoopForPetriNet]: 326 programPoint places, -4 predicate places. [2022-11-21 16:29:42,412 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 322 transitions, 688 flow [2022-11-21 16:29:42,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 316.5) internal successors, (633), 2 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:29:42,413 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:29:42,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:29:42,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-21 16:29:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -572076076, now seen corresponding path program 1 times [2022-11-21 16:29:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386497625] [2022-11-21 16:29:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:42,642 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-21 16:29:42,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:42,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386497625] [2022-11-21 16:29:42,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386497625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:42,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:42,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:29:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449413752] [2022-11-21 16:29:42,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:42,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:29:42,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:29:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:29:42,645 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 386 [2022-11-21 16:29:42,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 322 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:29:42,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 386 [2022-11-21 16:29:42,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:29:42,821 INFO L130 PetriNetUnfolder]: 29/707 cut-off events. [2022-11-21 16:29:42,821 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-11-21 16:29:42,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 707 events. 29/707 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3258 event pairs, 6 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 817. Up to 56 conditions per place. [2022-11-21 16:29:42,835 INFO L137 encePairwiseOnDemand]: 383/386 looper letters, 17 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2022-11-21 16:29:42,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 326 transitions, 734 flow [2022-11-21 16:29:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:29:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:29:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2022-11-21 16:29:42,838 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177892918825561 [2022-11-21 16:29:42,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 947 transitions. [2022-11-21 16:29:42,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 947 transitions. [2022-11-21 16:29:42,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:29:42,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 947 transitions. [2022-11-21 16:29:42,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 386.0) internal successors, (1544), 4 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 386.0) internal successors, (1544), 4 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,844 INFO L175 Difference]: Start difference. First operand has 322 places, 322 transitions, 688 flow. Second operand 3 states and 947 transitions. [2022-11-21 16:29:42,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 326 transitions, 734 flow [2022-11-21 16:29:42,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:29:42,850 INFO L231 Difference]: Finished difference. Result has 325 places, 323 transitions, 700 flow [2022-11-21 16:29:42,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=386, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=325, PETRI_TRANSITIONS=323} [2022-11-21 16:29:42,851 INFO L288 CegarLoopForPetriNet]: 326 programPoint places, -1 predicate places. [2022-11-21 16:29:42,851 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 323 transitions, 700 flow [2022-11-21 16:29:42,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:42,852 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:29:42,852 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:29:42,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:29:42,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-21 16:29:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:29:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1635043561, now seen corresponding path program 1 times [2022-11-21 16:29:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:29:42,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899557482] [2022-11-21 16:29:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:29:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:29:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:29:43,115 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-21 16:29:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:29:43,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899557482] [2022-11-21 16:29:43,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899557482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:29:43,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:29:43,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:29:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491554846] [2022-11-21 16:29:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:29:43,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:29:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:29:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:29:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:29:43,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 386 [2022-11-21 16:29:43,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 323 transitions, 700 flow. Second operand has 10 states, 10 states have (on average 251.1) internal successors, (2511), 10 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:29:43,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:29:43,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 386 [2022-11-21 16:29:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand