./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:57:32,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:57:32,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:57:32,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:57:32,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:57:32,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:57:32,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:57:32,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:57:32,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:57:32,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:57:32,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:57:32,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:57:32,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:57:32,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:57:32,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:57:32,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:57:32,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:57:32,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:57:32,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:57:32,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:57:32,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:57:32,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:57:32,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:57:32,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:57:32,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:57:32,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:57:32,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:57:32,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:57:32,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:57:32,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:57:32,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:57:32,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:57:32,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:57:32,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:57:32,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:57:32,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:57:32,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:57:32,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:57:32,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:57:32,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:57:32,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:57:32,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:57:32,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:57:32,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:57:32,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:57:32,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:57:32,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:57:32,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:57:32,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:57:32,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:57:32,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:57:32,714 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:57:32,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:57:32,715 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:57:32,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:57:32,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:57:32,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:57:32,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:57:32,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:57:32,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:57:32,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:57:32,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:57:32,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:57:32,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:57:32,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:57:32,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:57:32,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:57:32,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:57:32,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:57:32,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:57:32,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:57:32,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:57:32,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:57:32,719 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:57:32,719 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:57:32,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:57:32,719 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-13 21:57:33,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:57:33,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:57:33,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:57:33,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:57:33,039 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:57:33,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2022-07-13 21:57:33,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83094fe5e/3a9db8612b0d4fd3b6b85ff7f15789b8/FLAG35e4bd863 [2022-07-13 21:57:33,572 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:57:33,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2022-07-13 21:57:33,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83094fe5e/3a9db8612b0d4fd3b6b85ff7f15789b8/FLAG35e4bd863 [2022-07-13 21:57:33,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83094fe5e/3a9db8612b0d4fd3b6b85ff7f15789b8 [2022-07-13 21:57:33,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:57:33,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:57:33,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:57:33,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:57:33,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:57:33,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:57:33" (1/1) ... [2022-07-13 21:57:33,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbc05fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:33, skipping insertion in model container [2022-07-13 21:57:33,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:57:33" (1/1) ... [2022-07-13 21:57:33,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:57:33,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:57:34,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2022-07-13 21:57:34,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:57:34,272 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:57:34,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2022-07-13 21:57:34,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:57:34,381 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:57:34,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34 WrapperNode [2022-07-13 21:57:34,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:57:34,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:57:34,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:57:34,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:57:34,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,447 INFO L137 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2022-07-13 21:57:34,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:57:34,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:57:34,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:57:34,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:57:34,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:57:34,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:57:34,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:57:34,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:57:34,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (1/1) ... [2022-07-13 21:57:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:57:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:34,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:57:34,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:57:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:57:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:57:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 21:57:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:57:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:57:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-13 21:57:34,554 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-13 21:57:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:57:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:57:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:57:34,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:57:34,556 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:57:34,658 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:57:34,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:57:34,840 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:57:34,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:57:34,848 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-07-13 21:57:34,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:57:34 BoogieIcfgContainer [2022-07-13 21:57:34,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:57:34,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:57:34,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:57:34,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:57:34,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:57:33" (1/3) ... [2022-07-13 21:57:34,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7db685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:57:34, skipping insertion in model container [2022-07-13 21:57:34,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:34" (2/3) ... [2022-07-13 21:57:34,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7db685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:57:34, skipping insertion in model container [2022-07-13 21:57:34,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:57:34" (3/3) ... [2022-07-13 21:57:34,864 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2022-07-13 21:57:34,871 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:57:34,879 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:57:34,880 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:57:34,880 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:57:34,955 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-13 21:57:34,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 146 transitions, 300 flow [2022-07-13 21:57:35,076 INFO L129 PetriNetUnfolder]: 33/204 cut-off events. [2022-07-13 21:57:35,077 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-13 21:57:35,082 INFO L84 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 672 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-07-13 21:57:35,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 146 transitions, 300 flow [2022-07-13 21:57:35,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 141 transitions, 287 flow [2022-07-13 21:57:35,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:35,117 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2604510b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6eb6f6c7 [2022-07-13 21:57:35,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 21:57:35,153 INFO L129 PetriNetUnfolder]: 11/102 cut-off events. [2022-07-13 21:57:35,153 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:35,155 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:35,155 INFO L200 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-07-13 21:57:35,156 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-07-13 21:57:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash 240493146, now seen corresponding path program 1 times [2022-07-13 21:57:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563210918] [2022-07-13 21:57:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563210918] [2022-07-13 21:57:35,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563210918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:35,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:35,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:57:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943959732] [2022-07-13 21:57:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:35,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:57:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:57:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:57:35,419 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 146 [2022-07-13 21:57:35,422 INFO L92 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-07-13 21:57:35,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:35,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 146 [2022-07-13 21:57:35,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:35,457 INFO L129 PetriNetUnfolder]: 1/165 cut-off events. [2022-07-13 21:57:35,457 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-13 21:57:35,458 INFO L84 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 313 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-07-13 21:57:35,460 INFO L132 encePairwiseOnDemand]: 126/146 looper letters, 1 selfloop transitions, 0 changer transitions 0/119 dead transitions. [2022-07-13 21:57:35,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 245 flow [2022-07-13 21:57:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:57:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:57:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 265 transitions. [2022-07-13 21:57:35,479 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9075342465753424 [2022-07-13 21:57:35,480 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 265 transitions. [2022-07-13 21:57:35,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 265 transitions. [2022-07-13 21:57:35,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:35,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 265 transitions. [2022-07-13 21:57:35,491 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-07-13 21:57:35,499 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-07-13 21:57:35,499 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-07-13 21:57:35,501 INFO L186 Difference]: Start difference. First operand has 123 places, 141 transitions, 287 flow. Second operand 2 states and 265 transitions. [2022-07-13 21:57:35,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 245 flow [2022-07-13 21:57:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:35,508 INFO L242 Difference]: Finished difference. Result has 122 places, 119 transitions, 243 flow [2022-07-13 21:57:35,510 INFO L262 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-07-13 21:57:35,514 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-07-13 21:57:35,514 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 243 flow [2022-07-13 21:57:35,515 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-07-13 21:57:35,515 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:35,516 INFO L200 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-07-13 21:57:35,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:57:35,517 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-07-13 21:57:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash 653294572, now seen corresponding path program 1 times [2022-07-13 21:57:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:35,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256547521] [2022-07-13 21:57:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:35,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:35,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:35,657 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:35,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-07-13 21:57:35,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-07-13 21:57:35,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-07-13 21:57:35,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-07-13 21:57:35,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:57:35,663 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-13 21:57:35,669 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:35,669 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-13 21:57:35,703 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-13 21:57:35,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 195 transitions, 408 flow [2022-07-13 21:57:35,771 INFO L129 PetriNetUnfolder]: 57/336 cut-off events. [2022-07-13 21:57:35,771 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-13 21:57:35,778 INFO L84 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 1280 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-07-13 21:57:35,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 195 transitions, 408 flow [2022-07-13 21:57:35,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 195 transitions, 408 flow [2022-07-13 21:57:35,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:35,800 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2604510b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6eb6f6c7 [2022-07-13 21:57:35,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:35,808 INFO L129 PetriNetUnfolder]: 11/103 cut-off events. [2022-07-13 21:57:35,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:35,809 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:35,809 INFO L200 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-07-13 21:57:35,809 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-07-13 21:57:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1100514403, now seen corresponding path program 1 times [2022-07-13 21:57:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:35,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416394983] [2022-07-13 21:57:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:35,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416394983] [2022-07-13 21:57:35,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416394983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:35,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:35,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:57:35,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674956264] [2022-07-13 21:57:35,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:35,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:57:35,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:57:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:57:35,887 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 195 [2022-07-13 21:57:35,887 INFO L92 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-07-13 21:57:35,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:35,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 195 [2022-07-13 21:57:35,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:35,945 INFO L129 PetriNetUnfolder]: 5/279 cut-off events. [2022-07-13 21:57:35,945 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-07-13 21:57:35,949 INFO L84 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 819 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-07-13 21:57:35,950 INFO L132 encePairwiseOnDemand]: 166/195 looper letters, 4 selfloop transitions, 0 changer transitions 0/163 dead transitions. [2022-07-13 21:57:35,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 163 transitions, 352 flow [2022-07-13 21:57:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:57:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:57:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 351 transitions. [2022-07-13 21:57:35,954 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-07-13 21:57:35,954 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 351 transitions. [2022-07-13 21:57:35,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 351 transitions. [2022-07-13 21:57:35,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:35,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 351 transitions. [2022-07-13 21:57:35,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-07-13 21:57:35,958 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-07-13 21:57:35,958 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-07-13 21:57:35,958 INFO L186 Difference]: Start difference. First operand has 167 places, 195 transitions, 408 flow. Second operand 2 states and 351 transitions. [2022-07-13 21:57:35,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 163 transitions, 352 flow [2022-07-13 21:57:35,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:35,967 INFO L242 Difference]: Finished difference. Result has 165 places, 163 transitions, 344 flow [2022-07-13 21:57:35,968 INFO L262 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-07-13 21:57:35,969 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, -2 predicate places. [2022-07-13 21:57:35,969 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 163 transitions, 344 flow [2022-07-13 21:57:35,970 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-07-13 21:57:35,970 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:35,970 INFO L200 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-07-13 21:57:35,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:57:35,971 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-07-13 21:57:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1703677742, now seen corresponding path program 1 times [2022-07-13 21:57:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:35,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005350740] [2022-07-13 21:57:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005350740] [2022-07-13 21:57:36,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005350740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:36,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:36,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:57:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126647977] [2022-07-13 21:57:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:36,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:57:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:57:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:57:36,086 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 195 [2022-07-13 21:57:36,087 INFO L92 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-07-13 21:57:36,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:36,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 195 [2022-07-13 21:57:36,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:37,072 INFO L129 PetriNetUnfolder]: 1287/6396 cut-off events. [2022-07-13 21:57:37,073 INFO L130 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-07-13 21:57:37,090 INFO L84 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 296. Compared 70674 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-07-13 21:57:37,115 INFO L132 encePairwiseOnDemand]: 180/195 looper letters, 94 selfloop transitions, 26 changer transitions 3/258 dead transitions. [2022-07-13 21:57:37,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 258 transitions, 826 flow [2022-07-13 21:57:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1344 transitions. [2022-07-13 21:57:37,119 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7658119658119659 [2022-07-13 21:57:37,119 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1344 transitions. [2022-07-13 21:57:37,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1344 transitions. [2022-07-13 21:57:37,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:37,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1344 transitions. [2022-07-13 21:57:37,123 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-07-13 21:57:37,128 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-07-13 21:57:37,129 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-07-13 21:57:37,129 INFO L186 Difference]: Start difference. First operand has 165 places, 163 transitions, 344 flow. Second operand 9 states and 1344 transitions. [2022-07-13 21:57:37,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 258 transitions, 826 flow [2022-07-13 21:57:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 258 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:37,138 INFO L242 Difference]: Finished difference. Result has 180 places, 189 transitions, 551 flow [2022-07-13 21:57:37,139 INFO L262 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-07-13 21:57:37,141 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, 13 predicate places. [2022-07-13 21:57:37,141 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 189 transitions, 551 flow [2022-07-13 21:57:37,142 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-07-13 21:57:37,142 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:37,143 INFO L200 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-07-13 21:57:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:57:37,143 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-07-13 21:57:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1080746650, now seen corresponding path program 1 times [2022-07-13 21:57:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811017288] [2022-07-13 21:57:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:37,189 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:37,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:37,232 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:37,232 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-13 21:57:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:57:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-13 21:57:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-13 21:57:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:57:37,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:57:37,235 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 21:57:37,235 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:37,236 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-13 21:57:37,274 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 21:57:37,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 207 places, 244 transitions, 518 flow [2022-07-13 21:57:37,371 INFO L129 PetriNetUnfolder]: 86/501 cut-off events. [2022-07-13 21:57:37,372 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-13 21:57:37,376 INFO L84 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 2015 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-07-13 21:57:37,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 244 transitions, 518 flow [2022-07-13 21:57:37,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 244 transitions, 518 flow [2022-07-13 21:57:37,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:37,384 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2604510b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6eb6f6c7 [2022-07-13 21:57:37,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 21:57:37,390 INFO L129 PetriNetUnfolder]: 10/99 cut-off events. [2022-07-13 21:57:37,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:37,390 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:37,390 INFO L200 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-07-13 21:57:37,390 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-07-13 21:57:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1966620688, now seen corresponding path program 1 times [2022-07-13 21:57:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:37,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890275948] [2022-07-13 21:57:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:37,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:37,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890275948] [2022-07-13 21:57:37,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890275948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:37,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:37,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826675712] [2022-07-13 21:57:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:37,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:37,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:37,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:37,420 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 244 [2022-07-13 21:57:37,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 244 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:37,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:37,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 244 [2022-07-13 21:57:37,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:37,485 INFO L129 PetriNetUnfolder]: 10/386 cut-off events. [2022-07-13 21:57:37,485 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-07-13 21:57:37,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 386 events. 10/386 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1301 event pairs, 1 based on Foata normal form. 298/664 useless extension candidates. Maximal degree in co-relation 290. Up to 30 conditions per place. [2022-07-13 21:57:37,490 INFO L132 encePairwiseOnDemand]: 203/244 looper letters, 15 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2022-07-13 21:57:37,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 206 transitions, 476 flow [2022-07-13 21:57:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-07-13 21:57:37,493 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8647540983606558 [2022-07-13 21:57:37,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2022-07-13 21:57:37,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2022-07-13 21:57:37,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:37,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2022-07-13 21:57:37,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:37,497 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-07-13 21:57:37,497 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-07-13 21:57:37,498 INFO L186 Difference]: Start difference. First operand has 207 places, 244 transitions, 518 flow. Second operand 3 states and 633 transitions. [2022-07-13 21:57:37,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 206 transitions, 476 flow [2022-07-13 21:57:37,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:37,502 INFO L242 Difference]: Finished difference. Result has 206 places, 203 transitions, 446 flow [2022-07-13 21:57:37,502 INFO L262 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2022-07-13 21:57:37,504 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -1 predicate places. [2022-07-13 21:57:37,504 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 446 flow [2022-07-13 21:57:37,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:37,505 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:37,505 INFO L200 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-07-13 21:57:37,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:57:37,506 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-07-13 21:57:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1306727645, now seen corresponding path program 1 times [2022-07-13 21:57:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:37,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966538477] [2022-07-13 21:57:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:37,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:37,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966538477] [2022-07-13 21:57:37,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966538477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:37,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:37,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:57:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559926444] [2022-07-13 21:57:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:37,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:57:37,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:57:37,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:57:37,598 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 244 [2022-07-13 21:57:37,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 446 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-07-13 21:57:37,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:37,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 244 [2022-07-13 21:57:37,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:44,714 INFO L382 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], [Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 217#(= ~x~0 0), 188#L702-7true, t_funThread3of3ForFork0NotInUse]) [2022-07-13 21:57:44,715 INFO L384 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-07-13 21:57:44,715 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-07-13 21:57:44,715 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-13 21:57:44,715 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-07-13 21:57:44,792 INFO L382 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[][341], [Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 190#L702-4true, 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-07-13 21:57:44,793 INFO L384 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-07-13 21:57:44,793 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-07-13 21:57:44,793 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-13 21:57:44,793 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L382 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[][341], [60#L691true, Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-07-13 21:57:44,815 INFO L384 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L387 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L382 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[][344], [Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 210#true, 66#L691-5true, 71#L716-5true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread3of3ForFork0NotInUse]) [2022-07-13 21:57:44,815 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L387 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-07-13 21:57:44,815 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-07-13 21:57:44,816 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-07-13 21:57:44,816 INFO L382 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[][344], [Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 96#L691-1true, 210#true, 71#L716-5true, t_funThread1of3ForFork0InUse, 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse]) [2022-07-13 21:57:44,816 INFO L384 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-07-13 21:57:44,816 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-13 21:57:44,816 INFO L387 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-07-13 21:57:44,816 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-13 21:57:44,962 INFO L129 PetriNetUnfolder]: 18285/68419 cut-off events. [2022-07-13 21:57:44,962 INFO L130 PetriNetUnfolder]: For 5358/5582 co-relation queries the response was YES. [2022-07-13 21:57:45,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97018 conditions, 68419 events. 18285/68419 cut-off events. For 5358/5582 co-relation queries the response was YES. Maximal size of possible extension queue 2532. Compared 1028116 event pairs, 7851 based on Foata normal form. 32/63877 useless extension candidates. Maximal degree in co-relation 96966. Up to 11617 conditions per place. [2022-07-13 21:57:45,732 INFO L132 encePairwiseOnDemand]: 225/244 looper letters, 151 selfloop transitions, 40 changer transitions 0/357 dead transitions. [2022-07-13 21:57:45,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 357 transitions, 1217 flow [2022-07-13 21:57:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1687 transitions. [2022-07-13 21:57:45,737 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7682149362477231 [2022-07-13 21:57:45,738 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1687 transitions. [2022-07-13 21:57:45,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1687 transitions. [2022-07-13 21:57:45,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:45,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1687 transitions. [2022-07-13 21:57:45,743 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-07-13 21:57:45,748 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-07-13 21:57:45,748 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-07-13 21:57:45,748 INFO L186 Difference]: Start difference. First operand has 206 places, 203 transitions, 446 flow. Second operand 9 states and 1687 transitions. [2022-07-13 21:57:45,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 357 transitions, 1217 flow [2022-07-13 21:57:45,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 357 transitions, 1215 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:45,820 INFO L242 Difference]: Finished difference. Result has 221 places, 241 transitions, 774 flow [2022-07-13 21:57:45,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=221, PETRI_TRANSITIONS=241} [2022-07-13 21:57:45,821 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 14 predicate places. [2022-07-13 21:57:45,821 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 241 transitions, 774 flow [2022-07-13 21:57:45,822 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-07-13 21:57:45,822 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:45,822 INFO L200 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-07-13 21:57:45,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:57:45,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:57:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2125649252, now seen corresponding path program 1 times [2022-07-13 21:57:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:45,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155875082] [2022-07-13 21:57:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:45,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155875082] [2022-07-13 21:57:45,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155875082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:45,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:45,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:57:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669057397] [2022-07-13 21:57:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:57:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:57:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:57:45,921 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 244 [2022-07-13 21:57:45,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 241 transitions, 774 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-07-13 21:57:45,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:45,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 244 [2022-07-13 21:57:45,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:56,822 INFO L382 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[][301], [Black: 225#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 227#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 218#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 3#L706-3true, Black: 215#true, Black: 219#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0NotInUse, Black: 217#(= ~x~0 0), 239#(= ~x~0 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2022-07-13 21:57:56,823 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-07-13 21:57:56,823 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-07-13 21:57:56,823 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-07-13 21:57:56,823 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-07-13 21:57:57,194 INFO L382 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[][324], [Black: 227#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 218#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 215#true, 192#L706-11true, Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 219#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), 71#L716-5true, t_funThread1of3ForFork0NotInUse, Black: 217#(= ~x~0 0), 237#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 225#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-13 21:57:57,194 INFO L384 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-07-13 21:57:57,194 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-13 21:57:57,194 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-13 21:57:57,194 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-07-13 21:57:57,696 INFO L382 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[][301], [Black: 225#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 227#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 218#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 215#true, t_funThread1of3ForFork0NotInUse, 71#L716-5true, Black: 219#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 217#(= ~x~0 0), 239#(= ~x~0 0), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2022-07-13 21:57:57,696 INFO L384 tUnfolder$Statistics]: this new event has 164 ancestors and is cut-off event [2022-07-13 21:57:57,696 INFO L387 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-07-13 21:57:57,696 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-07-13 21:57:57,696 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-13 21:57:57,731 INFO L129 PetriNetUnfolder]: 26624/107378 cut-off events. [2022-07-13 21:57:57,731 INFO L130 PetriNetUnfolder]: For 78356/79861 co-relation queries the response was YES. [2022-07-13 21:57:58,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196620 conditions, 107378 events. 26624/107378 cut-off events. For 78356/79861 co-relation queries the response was YES. Maximal size of possible extension queue 3702. Compared 1748469 event pairs, 11062 based on Foata normal form. 867/102329 useless extension candidates. Maximal degree in co-relation 180178. Up to 17550 conditions per place. [2022-07-13 21:57:58,838 INFO L132 encePairwiseOnDemand]: 228/244 looper letters, 149 selfloop transitions, 101 changer transitions 0/420 dead transitions. [2022-07-13 21:57:58,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 420 transitions, 2109 flow [2022-07-13 21:57:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1676 transitions. [2022-07-13 21:57:58,842 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7632058287795993 [2022-07-13 21:57:58,843 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1676 transitions. [2022-07-13 21:57:58,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1676 transitions. [2022-07-13 21:57:58,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:58,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1676 transitions. [2022-07-13 21:57:58,847 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-07-13 21:57:58,850 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-07-13 21:57:58,851 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-07-13 21:57:58,851 INFO L186 Difference]: Start difference. First operand has 221 places, 241 transitions, 774 flow. Second operand 9 states and 1676 transitions. [2022-07-13 21:57:58,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 420 transitions, 2109 flow [2022-07-13 21:57:59,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 420 transitions, 2109 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:59,005 INFO L242 Difference]: Finished difference. Result has 235 places, 307 transitions, 1532 flow [2022-07-13 21:57:59,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=221, 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=235, PETRI_TRANSITIONS=307} [2022-07-13 21:57:59,006 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 28 predicate places. [2022-07-13 21:57:59,007 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 307 transitions, 1532 flow [2022-07-13 21:57:59,007 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-07-13 21:57:59,007 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:59,007 INFO L200 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-07-13 21:57:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:57:59,008 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-07-13 21:57:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1092472100, now seen corresponding path program 1 times [2022-07-13 21:57:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:59,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135932695] [2022-07-13 21:57:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:59,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135932695] [2022-07-13 21:57:59,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135932695] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:59,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923660340] [2022-07-13 21:57:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:59,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:59,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:59,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:59,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 21:57:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:59,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:59,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:59,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:59,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923660340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:59,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:59,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:59,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375432020] [2022-07-13 21:57:59,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:59,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:59,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:59,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:59,316 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 244 [2022-07-13 21:57:59,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 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-07-13 21:57:59,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:59,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 244 [2022-07-13 21:57:59,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:01,640 INFO L382 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[][302], [Black: 237#true, Black: 227#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 221#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 218#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 215#true, Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 66#L691-5true, 71#L716-5true, Black: 219#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), t_funThread1of3ForFork0InUse, Black: 217#(= ~x~0 0), t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 225#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 212#(= |ULTIMATE.start_main_~i~0#1| 0), 241#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0)), 257#true, Black: 240#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 247#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 243#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 245#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(= ~x~0 0)]) [2022-07-13 21:58:01,641 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-07-13 21:58:01,641 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-07-13 21:58:01,641 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-07-13 21:58:01,641 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-07-13 21:58:02,046 INFO L129 PetriNetUnfolder]: 2306/18498 cut-off events. [2022-07-13 21:58:02,046 INFO L130 PetriNetUnfolder]: For 15218/15899 co-relation queries the response was YES. [2022-07-13 21:58:02,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31769 conditions, 18498 events. 2306/18498 cut-off events. For 15218/15899 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 262203 event pairs, 1206 based on Foata normal form. 6/17520 useless extension candidates. Maximal degree in co-relation 31640. Up to 2172 conditions per place. [2022-07-13 21:58:02,212 INFO L132 encePairwiseOnDemand]: 238/244 looper letters, 16 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2022-07-13 21:58:02,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 317 transitions, 1604 flow [2022-07-13 21:58:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:58:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:58:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1719 transitions. [2022-07-13 21:58:02,217 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7827868852459017 [2022-07-13 21:58:02,217 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1719 transitions. [2022-07-13 21:58:02,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1719 transitions. [2022-07-13 21:58:02,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:02,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1719 transitions. [2022-07-13 21:58:02,223 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-07-13 21:58:02,226 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-07-13 21:58:02,227 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-07-13 21:58:02,227 INFO L186 Difference]: Start difference. First operand has 235 places, 307 transitions, 1532 flow. Second operand 9 states and 1719 transitions. [2022-07-13 21:58:02,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 317 transitions, 1604 flow [2022-07-13 21:58:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 317 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:58:02,266 INFO L242 Difference]: Finished difference. Result has 246 places, 313 transitions, 1582 flow [2022-07-13 21:58:02,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=235, 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=246, PETRI_TRANSITIONS=313} [2022-07-13 21:58:02,268 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 39 predicate places. [2022-07-13 21:58:02,268 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 313 transitions, 1582 flow [2022-07-13 21:58:02,269 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-07-13 21:58:02,269 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:02,269 INFO L200 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-07-13 21:58:02,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 21:58:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:02,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:58:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -8851865, now seen corresponding path program 1 times [2022-07-13 21:58:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673176358] [2022-07-13 21:58:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:58:02,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:58:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:58:02,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:58:02,543 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:58:02,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-07-13 21:58:02,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-13 21:58:02,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-07-13 21:58:02,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-13 21:58:02,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-13 21:58:02,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-13 21:58:02,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:58:02,549 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-13 21:58:02,549 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:58:02,550 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-13 21:58:02,575 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-13 21:58:02,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 247 places, 293 transitions, 630 flow [2022-07-13 21:58:02,659 INFO L129 PetriNetUnfolder]: 127/734 cut-off events. [2022-07-13 21:58:02,659 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-13 21:58:02,670 INFO L84 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 3204 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-07-13 21:58:02,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 293 transitions, 630 flow [2022-07-13 21:58:02,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 293 transitions, 630 flow [2022-07-13 21:58:02,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:58:02,679 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2604510b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6eb6f6c7 [2022-07-13 21:58:02,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:58:02,685 INFO L129 PetriNetUnfolder]: 11/102 cut-off events. [2022-07-13 21:58:02,685 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:58:02,685 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:02,685 INFO L200 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-07-13 21:58:02,685 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-07-13 21:58:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1549893430, now seen corresponding path program 1 times [2022-07-13 21:58:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:02,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721260398] [2022-07-13 21:58:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:02,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721260398] [2022-07-13 21:58:02,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721260398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:58:02,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:58:02,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:58:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15816557] [2022-07-13 21:58:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:58:02,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:58:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:58:02,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:58:02,715 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 293 [2022-07-13 21:58:02,716 INFO L92 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-07-13 21:58:02,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:02,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 293 [2022-07-13 21:58:02,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:02,800 INFO L129 PetriNetUnfolder]: 25/623 cut-off events. [2022-07-13 21:58:02,801 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-13 21:58:02,808 INFO L84 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 2614 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-07-13 21:58:02,810 INFO L132 encePairwiseOnDemand]: 246/293 looper letters, 8 selfloop transitions, 0 changer transitions 0/241 dead transitions. [2022-07-13 21:58:02,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 241 transitions, 542 flow [2022-07-13 21:58:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:58:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:58:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2022-07-13 21:58:02,812 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8890784982935154 [2022-07-13 21:58:02,812 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2022-07-13 21:58:02,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2022-07-13 21:58:02,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:02,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2022-07-13 21:58:02,813 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-07-13 21:58:02,815 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-07-13 21:58:02,815 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-07-13 21:58:02,815 INFO L186 Difference]: Start difference. First operand has 247 places, 293 transitions, 630 flow. Second operand 2 states and 521 transitions. [2022-07-13 21:58:02,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 241 transitions, 542 flow [2022-07-13 21:58:02,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 241 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:58:02,819 INFO L242 Difference]: Finished difference. Result has 243 places, 241 transitions, 526 flow [2022-07-13 21:58:02,820 INFO L262 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-07-13 21:58:02,820 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -4 predicate places. [2022-07-13 21:58:02,821 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 241 transitions, 526 flow [2022-07-13 21:58:02,821 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-07-13 21:58:02,821 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:02,821 INFO L200 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-07-13 21:58:02,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:58:02,822 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-07-13 21:58:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash 293676076, now seen corresponding path program 1 times [2022-07-13 21:58:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:02,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974299462] [2022-07-13 21:58:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:02,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974299462] [2022-07-13 21:58:02,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974299462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:58:02,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:58:02,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:58:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124938624] [2022-07-13 21:58:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:58:02,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:58:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:58:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:58:02,890 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 293 [2022-07-13 21:58:02,891 INFO L92 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-07-13 21:58:02,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:02,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 293 [2022-07-13 21:58:02,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand