./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_78-equ_racing.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 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:17:56,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:17:56,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:17:56,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:17:56,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:17:56,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:17:56,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:17:56,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:17:56,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:17:56,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:17:56,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:17:56,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:17:56,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:17:56,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:17:56,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:17:56,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:17:56,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:17:56,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:17:56,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:17:56,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:17:56,808 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:17:56,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:17:56,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:17:56,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:17:56,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:17:56,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:17:56,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:17:56,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:17:56,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:17:56,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:17:56,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:17:56,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:17:56,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:17:56,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:17:56,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:17:56,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:17:56,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:17:56,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:17:56,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:17:56,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:17:56,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:17:56,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:17:56,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:17:56,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:17:56,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:17:56,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:17:56,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:17:56,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:17:56,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:17:56,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:17:56,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:17:56,835 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:17:56,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:17:56,835 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:17:56,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:17:56,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:17:56,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:17:56,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:17:56,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:17:56,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:17:56,836 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:17:56,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:17:56,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:17:56,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:17:56,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:17:56,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:17:56,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:17:56,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:17:56,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:17:56,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:17:56,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:17:56,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:17:56,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:17:56,839 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:17:56,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:17:56,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:17:56,839 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 -> 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 [2022-07-12 10:17:57,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:17:57,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:17:57,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:17:57,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:17:57,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:17:57,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-07-12 10:17:57,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd0cd9d2/69ba2aadd7ee46f2bd4a119cdca2b26d/FLAG0a6b07a7e [2022-07-12 10:17:57,582 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:17:57,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-07-12 10:17:57,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd0cd9d2/69ba2aadd7ee46f2bd4a119cdca2b26d/FLAG0a6b07a7e [2022-07-12 10:17:58,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd0cd9d2/69ba2aadd7ee46f2bd4a119cdca2b26d [2022-07-12 10:17:58,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:17:58,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:17:58,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:17:58,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:17:58,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:17:58,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f79e1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58, skipping insertion in model container [2022-07-12 10:17:58,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:17:58,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:17:58,445 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_78-equ_racing.i[47038,47051] [2022-07-12 10:17:58,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:17:58,474 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:17:58,511 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_78-equ_racing.i[47038,47051] [2022-07-12 10:17:58,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:17:58,554 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:17:58,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58 WrapperNode [2022-07-12 10:17:58,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:17:58,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:17:58,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:17:58,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:17:58,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,591 INFO L137 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 198 [2022-07-12 10:17:58,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:17:58,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:17:58,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:17:58,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:17:58,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:17:58,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:17:58,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:17:58,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:17:58,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (1/1) ... [2022-07-12 10:17:58,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:17:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:58,668 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-12 10:17:58,670 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-12 10:17:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:17:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:17:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:17:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:17:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-12 10:17:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:17:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-12 10:17:58,699 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-12 10:17:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:17:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:17:58,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:17:58,700 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:17:58,781 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:17:58,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:17:58,982 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:17:58,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:17:58,989 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2022-07-12 10:17:58,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:17:58 BoogieIcfgContainer [2022-07-12 10:17:58,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:17:58,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:17:58,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:17:58,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:17:58,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:17:58" (1/3) ... [2022-07-12 10:17:59,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f7cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:17:59, skipping insertion in model container [2022-07-12 10:17:59,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:58" (2/3) ... [2022-07-12 10:17:59,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f7cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:17:59, skipping insertion in model container [2022-07-12 10:17:59,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:17:58" (3/3) ... [2022-07-12 10:17:59,003 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-07-12 10:17:59,006 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:17:59,013 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:17:59,013 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:17:59,013 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:17:59,086 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-12 10:17:59,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-07-12 10:17:59,183 INFO L129 PetriNetUnfolder]: 42/275 cut-off events. [2022-07-12 10:17:59,183 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:17:59,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 275 events. 42/275 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 888 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2022-07-12 10:17:59,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-07-12 10:17:59,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-07-12 10:17:59,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:17:59,203 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@7a3e9b57, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12e0b0eb [2022-07-12 10:17:59,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:17:59,234 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-07-12 10:17:59,234 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:17:59,235 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:59,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:59,236 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-12 10:17:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1755706946, now seen corresponding path program 1 times [2022-07-12 10:17:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:59,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491168659] [2022-07-12 10:17:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:59,462 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-12 10:17:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:59,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491168659] [2022-07-12 10:17:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491168659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:59,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:17:59,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:17:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508077007] [2022-07-12 10:17:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:59,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:59,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:17:59,505 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2022-07-12 10:17:59,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 198 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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-12 10:17:59,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:59,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2022-07-12 10:17:59,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:59,556 INFO L129 PetriNetUnfolder]: 3/176 cut-off events. [2022-07-12 10:17:59,557 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:17:59,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 296 event pairs, 0 based on Foata normal form. 40/209 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2022-07-12 10:17:59,560 INFO L132 encePairwiseOnDemand]: 176/203 looper letters, 8 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2022-07-12 10:17:59,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 373 flow [2022-07-12 10:17:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:17:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:17:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2022-07-12 10:17:59,571 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-07-12 10:17:59,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2022-07-12 10:17:59,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2022-07-12 10:17:59,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:59,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2022-07-12 10:17:59,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-12 10:17:59,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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-12 10:17:59,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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-12 10:17:59,585 INFO L186 Difference]: Start difference. First operand has 174 places, 198 transitions, 401 flow. Second operand 3 states and 551 transitions. [2022-07-12 10:17:59,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 373 flow [2022-07-12 10:17:59,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 174 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:17:59,596 INFO L242 Difference]: Finished difference. Result has 175 places, 172 transitions, 357 flow [2022-07-12 10:17:59,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2022-07-12 10:17:59,600 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2022-07-12 10:17:59,600 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 357 flow [2022-07-12 10:17:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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-12 10:17:59,600 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:59,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:59,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:17:59,601 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-12 10:17:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash 341960441, now seen corresponding path program 1 times [2022-07-12 10:17:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:59,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686820411] [2022-07-12 10:17:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:17:59,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:17:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:17:59,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:17:59,729 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:17:59,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-07-12 10:17:59,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-07-12 10:17:59,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-07-12 10:17:59,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-07-12 10:17:59,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:17:59,734 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 10:17:59,738 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-12 10:17:59,738 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-12 10:17:59,777 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 10:17:59,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-07-12 10:17:59,849 INFO L129 PetriNetUnfolder]: 71/432 cut-off events. [2022-07-12 10:17:59,850 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-12 10:17:59,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 71/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1670 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 277. Up to 12 conditions per place. [2022-07-12 10:17:59,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-07-12 10:17:59,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-07-12 10:17:59,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:17:59,891 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@7a3e9b57, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12e0b0eb [2022-07-12 10:17:59,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-12 10:17:59,904 INFO L129 PetriNetUnfolder]: 15/169 cut-off events. [2022-07-12 10:17:59,904 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:17:59,904 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:59,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:59,905 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-12 10:17:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash -985271127, now seen corresponding path program 1 times [2022-07-12 10:17:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:59,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645571550] [2022-07-12 10:17:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:59,966 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-12 10:17:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:59,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645571550] [2022-07-12 10:17:59,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645571550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:59,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:17:59,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:17:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113828702] [2022-07-12 10:17:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:17:59,970 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 263 [2022-07-12 10:17:59,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 263 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-12 10:17:59,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:59,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 263 [2022-07-12 10:17:59,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:00,027 INFO L129 PetriNetUnfolder]: 7/320 cut-off events. [2022-07-12 10:18:00,028 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-07-12 10:18:00,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 320 events. 7/320 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1017 event pairs, 0 based on Foata normal form. 127/432 useless extension candidates. Maximal degree in co-relation 203. Up to 16 conditions per place. [2022-07-12 10:18:00,031 INFO L132 encePairwiseOnDemand]: 225/263 looper letters, 13 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-07-12 10:18:00,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 506 flow [2022-07-12 10:18:00,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:18:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:18:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-07-12 10:18:00,036 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8935361216730038 [2022-07-12 10:18:00,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-07-12 10:18:00,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-07-12 10:18:00,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:00,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-07-12 10:18:00,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-12 10:18:00,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 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-12 10:18:00,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 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-12 10:18:00,042 INFO L186 Difference]: Start difference. First operand has 227 places, 263 transitions, 544 flow. Second operand 3 states and 705 transitions. [2022-07-12 10:18:00,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 506 flow [2022-07-12 10:18:00,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:18:00,051 INFO L242 Difference]: Finished difference. Result has 227 places, 226 transitions, 480 flow [2022-07-12 10:18:00,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-07-12 10:18:00,052 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 0 predicate places. [2022-07-12 10:18:00,052 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 480 flow [2022-07-12 10:18:00,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 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-12 10:18:00,053 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:00,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:00,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:18:00,054 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-12 10:18:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash 699851186, now seen corresponding path program 1 times [2022-07-12 10:18:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:00,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343582841] [2022-07-12 10:18:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:00,295 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-12 10:18:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:00,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343582841] [2022-07-12 10:18:00,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343582841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:00,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:00,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:18:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738793109] [2022-07-12 10:18:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:00,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:18:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:18:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:18:00,302 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 263 [2022-07-12 10:18:00,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 480 flow. Second operand has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 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-12 10:18:00,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:00,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 263 [2022-07-12 10:18:00,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:01,590 INFO L129 PetriNetUnfolder]: 2234/8522 cut-off events. [2022-07-12 10:18:01,591 INFO L130 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-07-12 10:18:01,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12402 conditions, 8522 events. 2234/8522 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 97784 event pairs, 583 based on Foata normal form. 0/8170 useless extension candidates. Maximal degree in co-relation 12285. Up to 1371 conditions per place. [2022-07-12 10:18:01,671 INFO L132 encePairwiseOnDemand]: 248/263 looper letters, 187 selfloop transitions, 44 changer transitions 58/452 dead transitions. [2022-07-12 10:18:01,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 452 transitions, 1574 flow [2022-07-12 10:18:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 10:18:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-12 10:18:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4181 transitions. [2022-07-12 10:18:01,680 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6623891001267427 [2022-07-12 10:18:01,680 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4181 transitions. [2022-07-12 10:18:01,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4181 transitions. [2022-07-12 10:18:01,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:01,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4181 transitions. [2022-07-12 10:18:01,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 174.20833333333334) internal successors, (4181), 24 states have internal predecessors, (4181), 0 states have call successors, (0), 0 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-12 10:18:01,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 0 states have call successors, (0), 0 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-12 10:18:01,703 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 0 states have call successors, (0), 0 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-12 10:18:01,703 INFO L186 Difference]: Start difference. First operand has 227 places, 226 transitions, 480 flow. Second operand 24 states and 4181 transitions. [2022-07-12 10:18:01,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 452 transitions, 1574 flow [2022-07-12 10:18:01,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 452 transitions, 1572 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:01,710 INFO L242 Difference]: Finished difference. Result has 260 places, 276 transitions, 783 flow [2022-07-12 10:18:01,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=783, PETRI_PLACES=260, PETRI_TRANSITIONS=276} [2022-07-12 10:18:01,712 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 33 predicate places. [2022-07-12 10:18:01,712 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 276 transitions, 783 flow [2022-07-12 10:18:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 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-12 10:18:01,713 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:01,713 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, 1, 1, 1, 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-12 10:18:01,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:18:01,713 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-12 10:18:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1556719885, now seen corresponding path program 1 times [2022-07-12 10:18:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:01,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496655291] [2022-07-12 10:18:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:18:01,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:18:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:18:01,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:18:01,751 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:18:01,751 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-12 10:18:01,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-12 10:18:01,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-12 10:18:01,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-12 10:18:01,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-12 10:18:01,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:18:01,752 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 10:18:01,753 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-12 10:18:01,753 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-12 10:18:01,772 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:18:01,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 276 places, 323 transitions, 676 flow [2022-07-12 10:18:01,833 INFO L129 PetriNetUnfolder]: 105/622 cut-off events. [2022-07-12 10:18:01,834 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-12 10:18:01,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 622 events. 105/622 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2641 event pairs, 1 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 440. Up to 16 conditions per place. [2022-07-12 10:18:01,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 323 transitions, 676 flow [2022-07-12 10:18:01,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 323 transitions, 676 flow [2022-07-12 10:18:01,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:18:01,850 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@7a3e9b57, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12e0b0eb [2022-07-12 10:18:01,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:18:01,858 INFO L129 PetriNetUnfolder]: 16/169 cut-off events. [2022-07-12 10:18:01,858 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:18:01,858 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:01,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:01,859 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-12 10:18:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash 645618892, now seen corresponding path program 1 times [2022-07-12 10:18:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478101244] [2022-07-12 10:18:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:01,885 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-12 10:18:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:01,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478101244] [2022-07-12 10:18:01,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478101244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:01,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:01,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:18:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251479017] [2022-07-12 10:18:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:01,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:18:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:01,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:18:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:18:01,889 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-07-12 10:18:01,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 323 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 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-12 10:18:01,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:01,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-07-12 10:18:01,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:01,969 INFO L129 PetriNetUnfolder]: 14/481 cut-off events. [2022-07-12 10:18:01,969 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-07-12 10:18:01,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 481 events. 14/481 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1920 event pairs, 1 based on Foata normal form. 335/792 useless extension candidates. Maximal degree in co-relation 348. Up to 30 conditions per place. [2022-07-12 10:18:01,975 INFO L132 encePairwiseOnDemand]: 274/323 looper letters, 15 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2022-07-12 10:18:01,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 618 flow [2022-07-12 10:18:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:18:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:18:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2022-07-12 10:18:01,978 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8833849329205367 [2022-07-12 10:18:01,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 856 transitions. [2022-07-12 10:18:01,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 856 transitions. [2022-07-12 10:18:01,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:01,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 856 transitions. [2022-07-12 10:18:01,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 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-12 10:18:01,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 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-12 10:18:01,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 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-12 10:18:01,981 INFO L186 Difference]: Start difference. First operand has 276 places, 323 transitions, 676 flow. Second operand 3 states and 856 transitions. [2022-07-12 10:18:01,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 618 flow [2022-07-12 10:18:01,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 277 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:18:01,985 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 588 flow [2022-07-12 10:18:01,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2022-07-12 10:18:01,986 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2022-07-12 10:18:01,987 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 588 flow [2022-07-12 10:18:01,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 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-12 10:18:01,987 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:01,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:01,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:18:01,988 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-12 10:18:01,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash 179903816, now seen corresponding path program 1 times [2022-07-12 10:18:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:01,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953529451] [2022-07-12 10:18:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:02,099 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-12 10:18:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953529451] [2022-07-12 10:18:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953529451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:02,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:18:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078444712] [2022-07-12 10:18:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:18:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:18:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:18:02,103 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-07-12 10:18:02,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 207.1) internal successors, (2071), 10 states have internal predecessors, (2071), 0 states have call successors, (0), 0 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-12 10:18:02,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:02,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-07-12 10:18:02,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:10,053 INFO L129 PetriNetUnfolder]: 23971/72143 cut-off events. [2022-07-12 10:18:10,054 INFO L130 PetriNetUnfolder]: For 2761/2761 co-relation queries the response was YES. [2022-07-12 10:18:10,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107751 conditions, 72143 events. 23971/72143 cut-off events. For 2761/2761 co-relation queries the response was YES. Maximal size of possible extension queue 2962. Compared 1040069 event pairs, 5334 based on Foata normal form. 0/70062 useless extension candidates. Maximal degree in co-relation 107633. Up to 13661 conditions per place. [2022-07-12 10:18:10,855 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 343 selfloop transitions, 58 changer transitions 0/605 dead transitions. [2022-07-12 10:18:10,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 605 transitions, 2216 flow [2022-07-12 10:18:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 10:18:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-12 10:18:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5277 transitions. [2022-07-12 10:18:10,864 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6807275541795665 [2022-07-12 10:18:10,864 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5277 transitions. [2022-07-12 10:18:10,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5277 transitions. [2022-07-12 10:18:10,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:10,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5277 transitions. [2022-07-12 10:18:10,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 219.875) internal successors, (5277), 24 states have internal predecessors, (5277), 0 states have call successors, (0), 0 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-12 10:18:10,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 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-12 10:18:10,885 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 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-12 10:18:10,885 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 588 flow. Second operand 24 states and 5277 transitions. [2022-07-12 10:18:10,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 605 transitions, 2216 flow [2022-07-12 10:18:10,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 605 transitions, 2214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:10,897 INFO L242 Difference]: Finished difference. Result has 311 places, 335 transitions, 1008 flow [2022-07-12 10:18:10,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1008, PETRI_PLACES=311, PETRI_TRANSITIONS=335} [2022-07-12 10:18:10,900 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 35 predicate places. [2022-07-12 10:18:10,900 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 335 transitions, 1008 flow [2022-07-12 10:18:10,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.1) internal successors, (2071), 10 states have internal predecessors, (2071), 0 states have call successors, (0), 0 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-12 10:18:10,905 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:10,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:10,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:18:10,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:18:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1053447860, now seen corresponding path program 1 times [2022-07-12 10:18:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:10,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871346385] [2022-07-12 10:18:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:10,956 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-12 10:18:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:10,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871346385] [2022-07-12 10:18:10,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871346385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:10,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644021544] [2022-07-12 10:18:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:10,962 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-12 10:18:10,984 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-12 10:18:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:11,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 10:18:11,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:11,124 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-12 10:18:11,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:18:11,162 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-12 10:18:11,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644021544] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:18:11,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:18:11,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 10:18:11,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28124277] [2022-07-12 10:18:11,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:18:11,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:18:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:11,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:18:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:18:11,166 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 323 [2022-07-12 10:18:11,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 335 transitions, 1008 flow. Second operand has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 0 states have call successors, (0), 0 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-12 10:18:11,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:11,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 323 [2022-07-12 10:18:11,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:11,670 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 160#L1013-32true, Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 307#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5))]) [2022-07-12 10:18:11,671 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-07-12 10:18:11,671 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-12 10:18:11,671 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-07-12 10:18:11,671 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-12 10:18:11,678 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, 3#L1013-8true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-07-12 10:18:11,678 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-07-12 10:18:11,678 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-07-12 10:18:11,678 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-07-12 10:18:11,678 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-07-12 10:18:11,680 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [235#L999-1true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 347#true, t_funThread3of3ForFork0NotInUse, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-12 10:18:11,680 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-07-12 10:18:11,680 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-12 10:18:11,680 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-12 10:18:11,680 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-07-12 10:18:11,690 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, 200#L1013-34true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-12 10:18:11,690 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-07-12 10:18:11,691 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-07-12 10:18:11,691 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-07-12 10:18:11,691 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-07-12 10:18:11,710 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0NotInUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-07-12 10:18:11,710 INFO L384 tUnfolder$Statistics]: this new event has 214 ancestors and is cut-off event [2022-07-12 10:18:11,710 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-12 10:18:11,710 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-12 10:18:11,710 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-12 10:18:11,719 INFO L129 PetriNetUnfolder]: 554/4225 cut-off events. [2022-07-12 10:18:11,719 INFO L130 PetriNetUnfolder]: For 7181/7813 co-relation queries the response was YES. [2022-07-12 10:18:11,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8535 conditions, 4225 events. 554/4225 cut-off events. For 7181/7813 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 42248 event pairs, 134 based on Foata normal form. 37/4037 useless extension candidates. Maximal degree in co-relation 8370. Up to 493 conditions per place. [2022-07-12 10:18:11,800 INFO L132 encePairwiseOnDemand]: 317/323 looper letters, 16 selfloop transitions, 9 changer transitions 0/345 dead transitions. [2022-07-12 10:18:11,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 345 transitions, 1080 flow [2022-07-12 10:18:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:18:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:18:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2358 transitions. [2022-07-12 10:18:11,819 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8111455108359134 [2022-07-12 10:18:11,819 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2358 transitions. [2022-07-12 10:18:11,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2358 transitions. [2022-07-12 10:18:11,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:11,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2358 transitions. [2022-07-12 10:18:11,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 262.0) internal successors, (2358), 9 states have internal predecessors, (2358), 0 states have call successors, (0), 0 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-12 10:18:11,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 0 states have call successors, (0), 0 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-12 10:18:11,828 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 0 states have call successors, (0), 0 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-12 10:18:11,828 INFO L186 Difference]: Start difference. First operand has 311 places, 335 transitions, 1008 flow. Second operand 9 states and 2358 transitions. [2022-07-12 10:18:11,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 345 transitions, 1080 flow [2022-07-12 10:18:11,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 345 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:11,868 INFO L242 Difference]: Finished difference. Result has 321 places, 341 transitions, 1057 flow [2022-07-12 10:18:11,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=321, PETRI_TRANSITIONS=341} [2022-07-12 10:18:11,875 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 45 predicate places. [2022-07-12 10:18:11,875 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 341 transitions, 1057 flow [2022-07-12 10:18:11,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 0 states have call successors, (0), 0 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-12 10:18:11,876 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:11,876 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, 1, 1, 1, 1, 1, 1, 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-12 10:18:11,921 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-12 10:18:12,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:12,093 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-12 10:18:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:12,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1734664745, now seen corresponding path program 1 times [2022-07-12 10:18:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:12,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117319373] [2022-07-12 10:18:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:18:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117319373] [2022-07-12 10:18:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117319373] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079253071] [2022-07-12 10:18:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:12,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:12,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:12,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:18:12,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:18:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:12,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 10:18:12,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:12,599 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:18:12,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:18:12,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:18:12,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:18:12,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 10:18:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 10:18:12,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:18:12,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_130) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-07-12 10:18:12,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-12 10:18:12,974 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 10:18:12,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 10:18:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-07-12 10:18:12,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079253071] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:18:12,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:18:12,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-07-12 10:18:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099013994] [2022-07-12 10:18:12,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:18:12,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 10:18:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 10:18:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2022-07-12 10:18:12,980 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-07-12 10:18:12,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 341 transitions, 1057 flow. Second operand has 17 states, 17 states have (on average 207.05882352941177) internal successors, (3520), 17 states have internal predecessors, (3520), 0 states have call successors, (0), 0 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-12 10:18:12,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:12,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-07-12 10:18:12,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:38,832 INFO L129 PetriNetUnfolder]: 54158/182335 cut-off events. [2022-07-12 10:18:38,833 INFO L130 PetriNetUnfolder]: For 320681/322897 co-relation queries the response was YES. [2022-07-12 10:18:40,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370604 conditions, 182335 events. 54158/182335 cut-off events. For 320681/322897 co-relation queries the response was YES. Maximal size of possible extension queue 7648. Compared 3078998 event pairs, 17513 based on Foata normal form. 391/175045 useless extension candidates. Maximal degree in co-relation 349392. Up to 32560 conditions per place. [2022-07-12 10:18:41,862 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 398 selfloop transitions, 157 changer transitions 22/804 dead transitions. [2022-07-12 10:18:41,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 804 transitions, 4278 flow [2022-07-12 10:18:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 10:18:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-12 10:18:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5289 transitions. [2022-07-12 10:18:41,872 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6822755417956656 [2022-07-12 10:18:41,872 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5289 transitions. [2022-07-12 10:18:41,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5289 transitions. [2022-07-12 10:18:41,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:41,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5289 transitions. [2022-07-12 10:18:41,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 220.375) internal successors, (5289), 24 states have internal predecessors, (5289), 0 states have call successors, (0), 0 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-12 10:18:41,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 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-12 10:18:41,889 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 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-12 10:18:41,889 INFO L186 Difference]: Start difference. First operand has 321 places, 341 transitions, 1057 flow. Second operand 24 states and 5289 transitions. [2022-07-12 10:18:41,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 804 transitions, 4278 flow [2022-07-12 10:18:43,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 804 transitions, 4272 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:43,908 INFO L242 Difference]: Finished difference. Result has 354 places, 465 transitions, 2169 flow [2022-07-12 10:18:43,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2169, PETRI_PLACES=354, PETRI_TRANSITIONS=465} [2022-07-12 10:18:43,912 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 78 predicate places. [2022-07-12 10:18:43,912 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 465 transitions, 2169 flow [2022-07-12 10:18:43,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 207.05882352941177) internal successors, (3520), 17 states have internal predecessors, (3520), 0 states have call successors, (0), 0 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-12 10:18:43,930 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:43,931 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, 1, 1, 1, 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-12 10:18:43,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 10:18:44,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 10:18:44,131 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-12 10:18:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash -405832410, now seen corresponding path program 1 times [2022-07-12 10:18:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535320342] [2022-07-12 10:18:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:18:44,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:18:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:18:44,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:18:44,179 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:18:44,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-07-12 10:18:44,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:18:44,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-07-12 10:18:44,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-12 10:18:44,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-12 10:18:44,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:18:44,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:18:44,180 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-12 10:18:44,181 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-12 10:18:44,181 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-12 10:18:44,202 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-12 10:18:44,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 325 places, 383 transitions, 810 flow [2022-07-12 10:18:44,301 INFO L129 PetriNetUnfolder]: 151/880 cut-off events. [2022-07-12 10:18:44,301 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-12 10:18:44,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 880 events. 151/880 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4022 event pairs, 6 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 642. Up to 32 conditions per place. [2022-07-12 10:18:44,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 383 transitions, 810 flow [2022-07-12 10:18:44,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 383 transitions, 810 flow [2022-07-12 10:18:44,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:18:44,326 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@7a3e9b57, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12e0b0eb [2022-07-12 10:18:44,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 10:18:44,334 INFO L129 PetriNetUnfolder]: 17/170 cut-off events. [2022-07-12 10:18:44,334 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:18:44,334 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:44,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:44,335 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-12 10:18:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash 971767631, now seen corresponding path program 1 times [2022-07-12 10:18:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:44,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769850014] [2022-07-12 10:18:44,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:44,354 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-12 10:18:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:44,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769850014] [2022-07-12 10:18:44,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769850014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:44,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:44,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:18:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711626802] [2022-07-12 10:18:44,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:44,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:18:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:18:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:18:44,357 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 383 [2022-07-12 10:18:44,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 383 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 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-12 10:18:44,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:44,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 383 [2022-07-12 10:18:44,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:44,469 INFO L129 PetriNetUnfolder]: 29/706 cut-off events. [2022-07-12 10:18:44,469 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-07-12 10:18:44,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 706 events. 29/706 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3256 event pairs, 6 based on Foata normal form. 735/1404 useless extension candidates. Maximal degree in co-relation 535. Up to 56 conditions per place. [2022-07-12 10:18:44,479 INFO L132 encePairwiseOnDemand]: 323/383 looper letters, 17 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2022-07-12 10:18:44,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 325 transitions, 732 flow [2022-07-12 10:18:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:18:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:18:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2022-07-12 10:18:44,482 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.876414273281114 [2022-07-12 10:18:44,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1007 transitions. [2022-07-12 10:18:44,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1007 transitions. [2022-07-12 10:18:44,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:44,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1007 transitions. [2022-07-12 10:18:44,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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-12 10:18:44,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 0 states have call successors, (0), 0 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-12 10:18:44,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 0 states have call successors, (0), 0 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-12 10:18:44,486 INFO L186 Difference]: Start difference. First operand has 325 places, 383 transitions, 810 flow. Second operand 3 states and 1007 transitions. [2022-07-12 10:18:44,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 325 transitions, 732 flow [2022-07-12 10:18:44,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 325 transitions, 732 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:18:44,490 INFO L242 Difference]: Finished difference. Result has 323 places, 322 transitions, 698 flow [2022-07-12 10:18:44,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=323, PETRI_TRANSITIONS=322} [2022-07-12 10:18:44,491 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -2 predicate places. [2022-07-12 10:18:44,491 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 322 transitions, 698 flow [2022-07-12 10:18:44,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 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-12 10:18:44,492 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:44,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:44,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:18:44,492 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-12 10:18:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -748866388, now seen corresponding path program 1 times [2022-07-12 10:18:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:44,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657617460] [2022-07-12 10:18:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:44,588 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-12 10:18:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657617460] [2022-07-12 10:18:44,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657617460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:44,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:44,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:18:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382000498] [2022-07-12 10:18:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:44,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:18:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:18:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:18:44,592 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 383 [2022-07-12 10:18:44,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 322 transitions, 698 flow. Second operand has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 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-12 10:18:44,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:44,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 383 [2022-07-12 10:18:44,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand