./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro --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 ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- 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-8393723 [2022-11-18 21:07:03,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:07:03,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:07:03,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:07:03,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:07:03,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:07:03,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:07:03,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:07:03,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:07:03,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:07:03,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:07:03,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:07:03,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:07:03,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:07:03,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:07:03,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:07:03,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:07:03,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:07:03,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:07:03,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:07:03,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:07:03,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:07:03,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:07:03,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:07:03,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:07:03,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:07:03,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:07:03,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:07:03,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:07:03,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:07:03,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:07:03,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:07:03,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:07:03,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:07:03,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:07:03,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:07:03,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:07:03,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:07:03,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:07:03,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:07:03,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:07:03,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:07:03,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:07:03,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:07:03,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:07:03,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:07:03,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:07:03,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:07:03,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:07:03,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:07:03,779 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:07:03,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:07:03,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:07:03,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:07:03,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:07:03,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:07:03,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:07:03,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:07:03,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:07:03,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:07:03,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:07:03,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:07:03,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:07:03,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:07:03,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:07:03,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:07:03,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:07:03,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:07:03,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:07:03,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:07:03,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:07:03,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:07:03,783 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:07:03,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:07:03,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:07:03,784 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_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/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_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2022-11-18 21:07:04,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:07:04,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:07:04,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:07:04,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:07:04,091 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:07:04,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2022-11-18 21:07:04,163 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/data/168e4a12b/5c5e76fbd3a6445cbc857aa5fa024d35/FLAG2d296856b [2022-11-18 21:07:04,720 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:07:04,721 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2022-11-18 21:07:04,742 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/data/168e4a12b/5c5e76fbd3a6445cbc857aa5fa024d35/FLAG2d296856b [2022-11-18 21:07:05,047 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/data/168e4a12b/5c5e76fbd3a6445cbc857aa5fa024d35 [2022-11-18 21:07:05,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:07:05,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:07:05,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:07:05,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:07:05,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:07:05,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1688418d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05, skipping insertion in model container [2022-11-18 21:07:05,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:07:05,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:07:05,475 WARN L234 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_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2022-11-18 21:07:05,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:07:05,536 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:07:05,588 WARN L234 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_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2022-11-18 21:07:05,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:07:05,664 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:07:05,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05 WrapperNode [2022-11-18 21:07:05,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:07:05,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:07:05,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:07:05,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:07:05,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,754 INFO L138 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2022-11-18 21:07:05,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:07:05,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:07:05,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:07:05,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:07:05,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:07:05,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:07:05,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:07:05,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:07:05,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (1/1) ... [2022-11-18 21:07:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:07:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:07:05,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:07:05,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:07:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 21:07:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:07:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 21:07:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:07:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:07:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-18 21:07:05,935 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-18 21:07:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:07:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:07:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:07:05,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:07:05,939 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:07:06,102 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:07:06,104 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:07:06,368 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:07:06,377 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:07:06,378 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-18 21:07:06,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:06 BoogieIcfgContainer [2022-11-18 21:07:06,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:07:06,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:07:06,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:07:06,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:07:06,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:07:05" (1/3) ... [2022-11-18 21:07:06,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b09849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:07:06, skipping insertion in model container [2022-11-18 21:07:06,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:05" (2/3) ... [2022-11-18 21:07:06,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b09849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:07:06, skipping insertion in model container [2022-11-18 21:07:06,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:06" (3/3) ... [2022-11-18 21:07:06,403 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2022-11-18 21:07:06,413 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 21:07:06,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:07:06,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 21:07:06,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:07:06,553 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-18 21:07:06,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 146 transitions, 300 flow [2022-11-18 21:07:06,730 INFO L130 PetriNetUnfolder]: 33/204 cut-off events. [2022-11-18 21:07:06,731 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 21:07:06,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 204 events. 33/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 671 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2022-11-18 21:07:06,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 146 transitions, 300 flow [2022-11-18 21:07:06,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 141 transitions, 287 flow [2022-11-18 21:07:06,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:07:06,767 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;@16c6c564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:07:06,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 21:07:06,794 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-18 21:07:06,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:06,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:06,795 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] [2022-11-18 21:07:06,796 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-18 21:07:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 240493146, now seen corresponding path program 1 times [2022-11-18 21:07:06,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:06,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200975836] [2022-11-18 21:07:06,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:06,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:07,120 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-18 21:07:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:07,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200975836] [2022-11-18 21:07:07,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200975836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:07,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:07,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:07:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624434040] [2022-11-18 21:07:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:07,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:07:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:07,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:07:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:07:07,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 146 [2022-11-18 21:07:07,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 141 transitions, 287 flow. Second operand has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:07,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 146 [2022-11-18 21:07:07,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:07,305 INFO L130 PetriNetUnfolder]: 1/165 cut-off events. [2022-11-18 21:07:07,305 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 21:07:07,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 1/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 309 event pairs, 0 based on Foata normal form. 31/188 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-18 21:07:07,308 INFO L137 encePairwiseOnDemand]: 126/146 looper letters, 1 selfloop transitions, 0 changer transitions 0/119 dead transitions. [2022-11-18 21:07:07,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 245 flow [2022-11-18 21:07:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:07:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 21:07:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 265 transitions. [2022-11-18 21:07:07,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9075342465753424 [2022-11-18 21:07:07,330 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 265 transitions. [2022-11-18 21:07:07,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 265 transitions. [2022-11-18 21:07:07,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:07,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 265 transitions. [2022-11-18 21:07:07,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,347 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,350 INFO L175 Difference]: Start difference. First operand has 123 places, 141 transitions, 287 flow. Second operand 2 states and 265 transitions. [2022-11-18 21:07:07,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 245 flow [2022-11-18 21:07:07,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:07,359 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 243 flow [2022-11-18 21:07:07,362 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=243, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2022-11-18 21:07:07,378 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-18 21:07:07,380 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 243 flow [2022-11-18 21:07:07,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:07,382 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] [2022-11-18 21:07:07,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:07:07,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-18 21:07:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:07,386 INFO L85 PathProgramCache]: Analyzing trace with hash 653294572, now seen corresponding path program 1 times [2022-11-18 21:07:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:07,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896184863] [2022-11-18 21:07:07,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:07,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:07:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:07,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:07:07,491 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:07:07,493 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-18 21:07:07,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-18 21:07:07,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-11-18 21:07:07,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-18 21:07:07,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:07:07,498 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-18 21:07:07,501 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 21:07:07,501 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-18 21:07:07,561 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 21:07:07,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 195 transitions, 408 flow [2022-11-18 21:07:07,649 INFO L130 PetriNetUnfolder]: 57/336 cut-off events. [2022-11-18 21:07:07,655 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 21:07:07,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 336 events. 57/336 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1282 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 206. Up to 9 conditions per place. [2022-11-18 21:07:07,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 195 transitions, 408 flow [2022-11-18 21:07:07,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 195 transitions, 408 flow [2022-11-18 21:07:07,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:07:07,678 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;@16c6c564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:07:07,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-18 21:07:07,709 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-18 21:07:07,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:07,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:07,711 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] [2022-11-18 21:07:07,711 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-18 21:07:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1100514403, now seen corresponding path program 1 times [2022-11-18 21:07:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:07,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286904933] [2022-11-18 21:07:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:07,820 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-18 21:07:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286904933] [2022-11-18 21:07:07,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286904933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:07,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:07,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:07:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743067273] [2022-11-18 21:07:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:07,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:07:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:07:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:07:07,825 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 195 [2022-11-18 21:07:07,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 195 transitions, 408 flow. Second operand has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:07,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 195 [2022-11-18 21:07:07,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:07,932 INFO L130 PetriNetUnfolder]: 5/279 cut-off events. [2022-11-18 21:07:07,933 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-18 21:07:07,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 279 events. 5/279 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 815 event pairs, 0 based on Foata normal form. 73/338 useless extension candidates. Maximal degree in co-relation 174. Up to 7 conditions per place. [2022-11-18 21:07:07,942 INFO L137 encePairwiseOnDemand]: 166/195 looper letters, 4 selfloop transitions, 0 changer transitions 0/163 dead transitions. [2022-11-18 21:07:07,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 163 transitions, 352 flow [2022-11-18 21:07:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:07:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 21:07:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 351 transitions. [2022-11-18 21:07:07,950 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-11-18 21:07:07,950 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 351 transitions. [2022-11-18 21:07:07,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 351 transitions. [2022-11-18 21:07:07,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:07,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 351 transitions. [2022-11-18 21:07:07,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 175.5) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,963 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,963 INFO L175 Difference]: Start difference. First operand has 167 places, 195 transitions, 408 flow. Second operand 2 states and 351 transitions. [2022-11-18 21:07:07,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 163 transitions, 352 flow [2022-11-18 21:07:07,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:07,970 INFO L231 Difference]: Finished difference. Result has 165 places, 163 transitions, 344 flow [2022-11-18 21:07:07,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=344, PETRI_PLACES=165, PETRI_TRANSITIONS=163} [2022-11-18 21:07:07,973 INFO L288 CegarLoopForPetriNet]: 167 programPoint places, -2 predicate places. [2022-11-18 21:07:07,973 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 163 transitions, 344 flow [2022-11-18 21:07:07,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:07,974 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:07,974 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] [2022-11-18 21:07:07,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:07:07,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-11-18 21:07:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1703677742, now seen corresponding path program 1 times [2022-11-18 21:07:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:07,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899283323] [2022-11-18 21:07:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:08,308 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-18 21:07:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899283323] [2022-11-18 21:07:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899283323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:08,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:08,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:07:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255638136] [2022-11-18 21:07:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:08,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:07:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:07:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:07:08,316 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 195 [2022-11-18 21:07:08,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 163 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:08,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:08,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 195 [2022-11-18 21:07:08,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:09,762 INFO L130 PetriNetUnfolder]: 1287/6396 cut-off events. [2022-11-18 21:07:09,762 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-11-18 21:07:09,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8783 conditions, 6396 events. 1287/6396 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 70628 event pairs, 499 based on Foata normal form. 0/6003 useless extension candidates. Maximal degree in co-relation 8778. Up to 1001 conditions per place. [2022-11-18 21:07:09,810 INFO L137 encePairwiseOnDemand]: 180/195 looper letters, 94 selfloop transitions, 26 changer transitions 3/258 dead transitions. [2022-11-18 21:07:09,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 258 transitions, 826 flow [2022-11-18 21:07:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:07:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:07:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1344 transitions. [2022-11-18 21:07:09,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7658119658119659 [2022-11-18 21:07:09,816 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1344 transitions. [2022-11-18 21:07:09,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1344 transitions. [2022-11-18 21:07:09,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:09,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1344 transitions. [2022-11-18 21:07:09,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.33333333333334) internal successors, (1344), 9 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:09,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:09,829 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:09,829 INFO L175 Difference]: Start difference. First operand has 165 places, 163 transitions, 344 flow. Second operand 9 states and 1344 transitions. [2022-11-18 21:07:09,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 258 transitions, 826 flow [2022-11-18 21:07:09,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 258 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:09,844 INFO L231 Difference]: Finished difference. Result has 180 places, 189 transitions, 551 flow [2022-11-18 21:07:09,845 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=551, PETRI_PLACES=180, PETRI_TRANSITIONS=189} [2022-11-18 21:07:09,847 INFO L288 CegarLoopForPetriNet]: 167 programPoint places, 13 predicate places. [2022-11-18 21:07:09,848 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 189 transitions, 551 flow [2022-11-18 21:07:09,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:09,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:09,850 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] [2022-11-18 21:07:09,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:07:09,851 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 2 more)] === [2022-11-18 21:07:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1080746650, now seen corresponding path program 1 times [2022-11-18 21:07:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:09,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081680174] [2022-11-18 21:07:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:09,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:07:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:09,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:07:09,951 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:07:09,952 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-18 21:07:09,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-18 21:07:09,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-18 21:07:09,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-18 21:07:09,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-18 21:07:09,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:07:09,956 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-18 21:07:09,956 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 21:07:09,961 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-18 21:07:10,005 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 21:07:10,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 244 transitions, 518 flow [2022-11-18 21:07:10,089 INFO L130 PetriNetUnfolder]: 86/501 cut-off events. [2022-11-18 21:07:10,090 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-18 21:07:10,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 501 events. 86/501 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2001 event pairs, 1 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 344. Up to 16 conditions per place. [2022-11-18 21:07:10,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 244 transitions, 518 flow [2022-11-18 21:07:10,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 244 transitions, 518 flow [2022-11-18 21:07:10,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:07:10,106 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;@16c6c564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:07:10,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 21:07:10,115 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-18 21:07:10,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:10,115 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:10,115 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] [2022-11-18 21:07:10,116 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-18 21:07:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2095703407, now seen corresponding path program 1 times [2022-11-18 21:07:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480399101] [2022-11-18 21:07:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:10,140 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-18 21:07:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:10,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480399101] [2022-11-18 21:07:10,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480399101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:10,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:10,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:07:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975919687] [2022-11-18 21:07:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:10,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:07:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:07:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:07:10,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 244 [2022-11-18 21:07:10,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 244 transitions, 518 flow. Second operand has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:10,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:10,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 244 [2022-11-18 21:07:10,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:10,268 INFO L130 PetriNetUnfolder]: 11/419 cut-off events. [2022-11-18 21:07:10,268 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-18 21:07:10,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 419 events. 11/419 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1518 event pairs, 1 based on Foata normal form. 170/567 useless extension candidates. Maximal degree in co-relation 293. Up to 16 conditions per place. [2022-11-18 21:07:10,275 INFO L137 encePairwiseOnDemand]: 206/244 looper letters, 6 selfloop transitions, 0 changer transitions 0/202 dead transitions. [2022-11-18 21:07:10,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 446 flow [2022-11-18 21:07:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:07:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 21:07:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 436 transitions. [2022-11-18 21:07:10,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8934426229508197 [2022-11-18 21:07:10,278 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 436 transitions. [2022-11-18 21:07:10,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 436 transitions. [2022-11-18 21:07:10,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:10,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 436 transitions. [2022-11-18 21:07:10,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 218.0) internal successors, (436), 2 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:10,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:10,282 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:10,282 INFO L175 Difference]: Start difference. First operand has 207 places, 244 transitions, 518 flow. Second operand 2 states and 436 transitions. [2022-11-18 21:07:10,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 446 flow [2022-11-18 21:07:10,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:10,288 INFO L231 Difference]: Finished difference. Result has 204 places, 202 transitions, 434 flow [2022-11-18 21:07:10,289 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=434, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2022-11-18 21:07:10,290 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-18 21:07:10,290 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 434 flow [2022-11-18 21:07:10,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:10,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:10,291 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] [2022-11-18 21:07:10,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:07:10,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-18 21:07:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1306727645, now seen corresponding path program 1 times [2022-11-18 21:07:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:10,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077053973] [2022-11-18 21:07:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:10,405 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-18 21:07:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077053973] [2022-11-18 21:07:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077053973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:10,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:10,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:07:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773929493] [2022-11-18 21:07:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:07:10,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:07:10,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:07:10,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 244 [2022-11-18 21:07:10,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:10,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:10,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 244 [2022-11-18 21:07:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:20,017 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][320], [210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 215#(= ~x~0 0), t_funThread2of3ForFork0NotInUse, 188#L702-7true, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:20,017 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-18 21:07:20,017 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-18 21:07:20,017 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-18 21:07:20,018 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-18 21:07:20,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][321], [190#L702-4true, 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:20,076 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-18 21:07:20,077 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-18 21:07:20,077 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-18 21:07:20,077 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-11-18 21:07:20,126 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][321], [60#L691true, 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:20,126 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-18 21:07:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-18 21:07:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-18 21:07:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-18 21:07:20,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][323], [96#L691-1true, 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:20,172 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-18 21:07:20,172 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-18 21:07:20,172 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-18 21:07:20,172 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-18 21:07:20,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][323], [221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 210#true, 66#L691-5true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:20,206 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-18 21:07:20,206 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-18 21:07:20,206 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-18 21:07:20,206 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-18 21:07:20,445 INFO L130 PetriNetUnfolder]: 18279/64896 cut-off events. [2022-11-18 21:07:20,446 INFO L131 PetriNetUnfolder]: For 5131/5131 co-relation queries the response was YES. [2022-11-18 21:07:20,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93482 conditions, 64896 events. 18279/64896 cut-off events. For 5131/5131 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 958027 event pairs, 6477 based on Foata normal form. 0/60938 useless extension candidates. Maximal degree in co-relation 93476. Up to 11621 conditions per place. [2022-11-18 21:07:21,267 INFO L137 encePairwiseOnDemand]: 225/244 looper letters, 151 selfloop transitions, 40 changer transitions 0/356 dead transitions. [2022-11-18 21:07:21,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 356 transitions, 1205 flow [2022-11-18 21:07:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:07:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:07:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1687 transitions. [2022-11-18 21:07:21,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7682149362477231 [2022-11-18 21:07:21,277 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1687 transitions. [2022-11-18 21:07:21,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1687 transitions. [2022-11-18 21:07:21,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:21,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1687 transitions. [2022-11-18 21:07:21,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.44444444444446) internal successors, (1687), 9 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:21,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:21,292 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:21,292 INFO L175 Difference]: Start difference. First operand has 204 places, 202 transitions, 434 flow. Second operand 9 states and 1687 transitions. [2022-11-18 21:07:21,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 356 transitions, 1205 flow [2022-11-18 21:07:21,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 356 transitions, 1205 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:21,462 INFO L231 Difference]: Finished difference. Result has 220 places, 240 transitions, 764 flow [2022-11-18 21:07:21,463 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=764, PETRI_PLACES=220, PETRI_TRANSITIONS=240} [2022-11-18 21:07:21,466 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 13 predicate places. [2022-11-18 21:07:21,467 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 240 transitions, 764 flow [2022-11-18 21:07:21,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:21,473 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:21,473 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] [2022-11-18 21:07:21,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:07:21,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-18 21:07:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1152243931, now seen corresponding path program 1 times [2022-11-18 21:07:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:21,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825389600] [2022-11-18 21:07:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:21,568 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-18 21:07:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:21,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825389600] [2022-11-18 21:07:21,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825389600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:21,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:21,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:07:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710078837] [2022-11-18 21:07:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:21,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:07:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:07:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:07:21,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 244 [2022-11-18 21:07:21,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 240 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:21,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:21,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 244 [2022-11-18 21:07:21,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:23,721 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 235#true, Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 74#L705true]) [2022-11-18 21:07:23,721 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-18 21:07:23,721 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-18 21:07:23,721 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-18 21:07:23,721 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-18 21:07:23,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 235#true, Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 190#L702-4true, 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:23,765 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-18 21:07:23,765 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-18 21:07:23,766 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-18 21:07:23,766 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-11-18 21:07:23,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 235#true, Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 159#L706-4true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:23,792 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-18 21:07:23,792 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-18 21:07:23,792 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-18 21:07:23,792 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-18 21:07:23,824 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 190#L702-4true, 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))]) [2022-11-18 21:07:23,825 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-18 21:07:23,825 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-18 21:07:23,825 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-18 21:07:23,825 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-11-18 21:07:23,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 96#L691-1true, 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2022-11-18 21:07:23,839 INFO L383 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-11-18 21:07:23,840 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-18 21:07:23,840 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-18 21:07:23,840 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-18 21:07:23,851 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, 215#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 150#L706-12true]) [2022-11-18 21:07:23,852 INFO L383 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-11-18 21:07:23,852 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-18 21:07:23,852 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-18 21:07:23,852 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 21:07:23,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_13|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0NotInUse, 71#L716-5true, t_funThread2of3ForFork0NotInUse, 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), t_funThread3of3ForFork0NotInUse]) [2022-11-18 21:07:23,890 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-11-18 21:07:23,890 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-18 21:07:23,890 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 21:07:23,890 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-18 21:07:23,894 INFO L130 PetriNetUnfolder]: 1747/14011 cut-off events. [2022-11-18 21:07:23,894 INFO L131 PetriNetUnfolder]: For 6949/7679 co-relation queries the response was YES. [2022-11-18 21:07:23,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22367 conditions, 14011 events. 1747/14011 cut-off events. For 6949/7679 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 185490 event pairs, 930 based on Foata normal form. 50/13327 useless extension candidates. Maximal degree in co-relation 22353. Up to 1771 conditions per place. [2022-11-18 21:07:24,057 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 15 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2022-11-18 21:07:24,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 244 transitions, 806 flow [2022-11-18 21:07:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:07:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 21:07:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2022-11-18 21:07:24,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7991803278688525 [2022-11-18 21:07:24,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2022-11-18 21:07:24,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2022-11-18 21:07:24,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:24,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2022-11-18 21:07:24,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:24,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:24,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:24,066 INFO L175 Difference]: Start difference. First operand has 220 places, 240 transitions, 764 flow. Second operand 3 states and 585 transitions. [2022-11-18 21:07:24,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 244 transitions, 806 flow [2022-11-18 21:07:24,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 244 transitions, 806 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:24,095 INFO L231 Difference]: Finished difference. Result has 223 places, 241 transitions, 776 flow [2022-11-18 21:07:24,096 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=223, PETRI_TRANSITIONS=241} [2022-11-18 21:07:24,098 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 16 predicate places. [2022-11-18 21:07:24,098 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 241 transitions, 776 flow [2022-11-18 21:07:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:24,099 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:24,099 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] [2022-11-18 21:07:24,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:07:24,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-18 21:07:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2125649252, now seen corresponding path program 1 times [2022-11-18 21:07:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:24,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005552139] [2022-11-18 21:07:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 21:07:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005552139] [2022-11-18 21:07:24,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005552139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:24,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:24,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:07:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347526898] [2022-11-18 21:07:24,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:24,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:07:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:24,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:07:24,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:07:24,444 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 244 [2022-11-18 21:07:24,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 241 transitions, 776 flow. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:24,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:24,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 244 [2022-11-18 21:07:24,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:37,772 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([964] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][406], [235#true, Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, Black: 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 56#L691-5true, 71#L716-5true, t_funThread1of3ForFork0NotInUse, 252#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0), 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2022-11-18 21:07:37,773 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-18 21:07:37,773 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-18 21:07:37,773 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-18 21:07:37,773 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-18 21:07:38,525 INFO L130 PetriNetUnfolder]: 26254/100310 cut-off events. [2022-11-18 21:07:38,525 INFO L131 PetriNetUnfolder]: For 75895/76736 co-relation queries the response was YES. [2022-11-18 21:07:39,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189345 conditions, 100310 events. 26254/100310 cut-off events. For 75895/76736 co-relation queries the response was YES. Maximal size of possible extension queue 3760. Compared 1604370 event pairs, 10153 based on Foata normal form. 523/96257 useless extension candidates. Maximal degree in co-relation 189329. Up to 17517 conditions per place. [2022-11-18 21:07:39,734 INFO L137 encePairwiseOnDemand]: 228/244 looper letters, 149 selfloop transitions, 101 changer transitions 0/420 dead transitions. [2022-11-18 21:07:39,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 420 transitions, 2111 flow [2022-11-18 21:07:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:07:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:07:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1676 transitions. [2022-11-18 21:07:39,739 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7632058287795993 [2022-11-18 21:07:39,739 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1676 transitions. [2022-11-18 21:07:39,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1676 transitions. [2022-11-18 21:07:39,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:39,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1676 transitions. [2022-11-18 21:07:39,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:39,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:39,750 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:39,750 INFO L175 Difference]: Start difference. First operand has 223 places, 241 transitions, 776 flow. Second operand 9 states and 1676 transitions. [2022-11-18 21:07:39,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 420 transitions, 2111 flow [2022-11-18 21:07:40,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 420 transitions, 2109 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 21:07:40,027 INFO L231 Difference]: Finished difference. Result has 236 places, 307 transitions, 1532 flow [2022-11-18 21:07:40,028 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1532, PETRI_PLACES=236, PETRI_TRANSITIONS=307} [2022-11-18 21:07:40,029 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 29 predicate places. [2022-11-18 21:07:40,029 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 307 transitions, 1532 flow [2022-11-18 21:07:40,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:40,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:40,030 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] [2022-11-18 21:07:40,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:07:40,030 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-18 21:07:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 731972702, now seen corresponding path program 1 times [2022-11-18 21:07:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:40,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693120413] [2022-11-18 21:07:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:40,113 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-18 21:07:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:40,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693120413] [2022-11-18 21:07:40,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693120413] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:07:40,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417246354] [2022-11-18 21:07:40,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:07:40,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:07:40,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:07:40,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 21:07:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:40,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 21:07:40,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:07:40,327 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-18 21:07:40,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:07:40,377 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-18 21:07:40,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417246354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:07:40,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:07:40,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 21:07:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771215874] [2022-11-18 21:07:40,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:07:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 21:07:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 21:07:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 21:07:40,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 244 [2022-11-18 21:07:40,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 307 transitions, 1532 flow. Second operand has 10 states, 10 states have (on average 190.3) internal successors, (1903), 10 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:40,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:40,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 244 [2022-11-18 21:07:40,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:42,994 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] t_funEXIT-->L716-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][299], [Black: 243#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 250#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 242#(= ~x~0 0), Black: 225#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 246#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#true, Black: 215#(= ~x~0 0), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 216#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 210#true, 66#L691-5true, Black: 217#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 237#(= |ULTIMATE.start_main_~i~0#1| 0), 260#true, 244#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0)), 223#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 248#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 240#true]) [2022-11-18 21:07:42,994 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-18 21:07:42,994 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-18 21:07:42,994 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 21:07:42,994 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 21:07:43,223 INFO L130 PetriNetUnfolder]: 2268/18986 cut-off events. [2022-11-18 21:07:43,223 INFO L131 PetriNetUnfolder]: For 14258/14971 co-relation queries the response was YES. [2022-11-18 21:07:43,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32103 conditions, 18986 events. 2268/18986 cut-off events. For 14258/14971 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 270896 event pairs, 1206 based on Foata normal form. 8/17968 useless extension candidates. Maximal degree in co-relation 32082. Up to 2163 conditions per place. [2022-11-18 21:07:43,385 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 16 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2022-11-18 21:07:43,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 317 transitions, 1604 flow [2022-11-18 21:07:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:07:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:07:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1719 transitions. [2022-11-18 21:07:43,390 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7827868852459017 [2022-11-18 21:07:43,390 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1719 transitions. [2022-11-18 21:07:43,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1719 transitions. [2022-11-18 21:07:43,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:43,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1719 transitions. [2022-11-18 21:07:43,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:43,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:43,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:43,402 INFO L175 Difference]: Start difference. First operand has 236 places, 307 transitions, 1532 flow. Second operand 9 states and 1719 transitions. [2022-11-18 21:07:43,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 317 transitions, 1604 flow [2022-11-18 21:07:43,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 317 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:43,459 INFO L231 Difference]: Finished difference. Result has 247 places, 313 transitions, 1582 flow [2022-11-18 21:07:43,460 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1582, PETRI_PLACES=247, PETRI_TRANSITIONS=313} [2022-11-18 21:07:43,460 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 40 predicate places. [2022-11-18 21:07:43,460 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 313 transitions, 1582 flow [2022-11-18 21:07:43,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 190.3) internal successors, (1903), 10 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:43,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:43,462 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] [2022-11-18 21:07:43,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 21:07:43,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40290deb-97f5-47ca-9dd1-4fb9a5e31cbf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 21:07:43,663 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-18 21:07:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash -8851865, now seen corresponding path program 1 times [2022-11-18 21:07:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473634308] [2022-11-18 21:07:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:43,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:07:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:07:43,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:07:43,735 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:07:43,736 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-18 21:07:43,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 21:07:43,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-11-18 21:07:43,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-18 21:07:43,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-18 21:07:43,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 21:07:43,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:07:43,737 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 21:07:43,738 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 21:07:43,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-18 21:07:43,790 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-18 21:07:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 293 transitions, 630 flow [2022-11-18 21:07:43,881 INFO L130 PetriNetUnfolder]: 127/734 cut-off events. [2022-11-18 21:07:43,881 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-18 21:07:43,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 734 events. 127/734 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3168 event pairs, 6 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 521. Up to 32 conditions per place. [2022-11-18 21:07:43,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 293 transitions, 630 flow [2022-11-18 21:07:43,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 293 transitions, 630 flow [2022-11-18 21:07:43,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:07:43,894 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;@16c6c564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:07:43,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 21:07:43,900 INFO L130 PetriNetUnfolder]: 10/98 cut-off events. [2022-11-18 21:07:43,900 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:43,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:43,900 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] [2022-11-18 21:07:43,901 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-18 21:07:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1549893430, now seen corresponding path program 1 times [2022-11-18 21:07:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:43,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713763518] [2022-11-18 21:07:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:43,919 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-18 21:07:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:43,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713763518] [2022-11-18 21:07:43,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713763518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:43,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:43,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:07:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27959754] [2022-11-18 21:07:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:07:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:07:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:07:43,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 293 [2022-11-18 21:07:43,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 293 transitions, 630 flow. Second operand has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:43,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:43,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 293 [2022-11-18 21:07:43,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:44,038 INFO L130 PetriNetUnfolder]: 25/623 cut-off events. [2022-11-18 21:07:44,038 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-11-18 21:07:44,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 623 events. 25/623 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2608 event pairs, 6 based on Foata normal form. 388/977 useless extension candidates. Maximal degree in co-relation 454. Up to 37 conditions per place. [2022-11-18 21:07:44,048 INFO L137 encePairwiseOnDemand]: 246/293 looper letters, 8 selfloop transitions, 0 changer transitions 0/241 dead transitions. [2022-11-18 21:07:44,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 241 transitions, 542 flow [2022-11-18 21:07:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:07:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 21:07:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2022-11-18 21:07:44,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8890784982935154 [2022-11-18 21:07:44,050 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2022-11-18 21:07:44,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2022-11-18 21:07:44,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:44,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2022-11-18 21:07:44,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 260.5) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:44,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:44,054 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:44,054 INFO L175 Difference]: Start difference. First operand has 247 places, 293 transitions, 630 flow. Second operand 2 states and 521 transitions. [2022-11-18 21:07:44,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 241 transitions, 542 flow [2022-11-18 21:07:44,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 241 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:07:44,058 INFO L231 Difference]: Finished difference. Result has 243 places, 241 transitions, 526 flow [2022-11-18 21:07:44,059 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=526, PETRI_PLACES=243, PETRI_TRANSITIONS=241} [2022-11-18 21:07:44,060 INFO L288 CegarLoopForPetriNet]: 247 programPoint places, -4 predicate places. [2022-11-18 21:07:44,060 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 241 transitions, 526 flow [2022-11-18 21:07:44,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:44,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:44,061 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] [2022-11-18 21:07:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 21:07:44,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-11-18 21:07:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 293676076, now seen corresponding path program 1 times [2022-11-18 21:07:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:44,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618979926] [2022-11-18 21:07:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:44,169 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-18 21:07:44,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:44,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618979926] [2022-11-18 21:07:44,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618979926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:44,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:44,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:07:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881302344] [2022-11-18 21:07:44,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:44,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:07:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:44,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:07:44,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:07:44,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 293 [2022-11-18 21:07:44,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 241 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 196.4) internal successors, (982), 5 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:07:44,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:44,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 293 [2022-11-18 21:07:44,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand