./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 17:32:23,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 17:32:23,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 17:32:23,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 17:32:23,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 17:32:23,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 17:32:23,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 17:32:23,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 17:32:23,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 17:32:23,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 17:32:23,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 17:32:23,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 17:32:23,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 17:32:23,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 17:32:23,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 17:32:23,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 17:32:23,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 17:32:23,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 17:32:23,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 17:32:23,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 17:32:23,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 17:32:23,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 17:32:23,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 17:32:23,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 17:32:23,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 17:32:23,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 17:32:23,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 17:32:23,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 17:32:23,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 17:32:23,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 17:32:23,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 17:32:23,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 17:32:23,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 17:32:23,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 17:32:23,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 17:32:23,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 17:32:23,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 17:32:23,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 17:32:23,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 17:32:23,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 17:32:23,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 17:32:23,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 17:32:23,887 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 17:32:23,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 17:32:23,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 17:32:23,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 17:32:23,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 17:32:23,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 17:32:23,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 17:32:23,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 17:32:23,890 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 17:32:23,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 17:32:23,891 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 17:32:23,891 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 17:32:23,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 17:32:23,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 17:32:23,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 17:32:23,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 17:32:23,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 17:32:23,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 17:32:23,893 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 17:32:23,893 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 17:32:23,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 17:32:23,893 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 17:32:23,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 17:32:23,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 17:32:23,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 17:32:23,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 17:32:23,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 17:32:23,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 17:32:23,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 17:32:23,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 17:32:23,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 17:32:23,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 17:32:23,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 17:32:23,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 17:32:23,896 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 17:32:23,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 17:32:23,896 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 17:32:23,896 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! data-race) ) 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-29 17:32:24,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 17:32:24,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 17:32:24,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 17:32:24,200 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 17:32:24,201 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 17:32:24,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-29 17:32:25,379 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 17:32:25,640 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 17:32:25,644 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-29 17:32:25,671 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35759164/980567a685f54a278798ddbd7a9384fd/FLAGfe4efb897 [2023-08-29 17:32:25,688 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35759164/980567a685f54a278798ddbd7a9384fd [2023-08-29 17:32:25,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 17:32:25,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 17:32:25,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 17:32:25,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 17:32:25,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 17:32:25,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 05:32:25" (1/1) ... [2023-08-29 17:32:25,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6220b4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:25, skipping insertion in model container [2023-08-29 17:32:25,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 05:32:25" (1/1) ... [2023-08-29 17:32:25,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 17:32:25,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 17:32:26,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 17:32:26,113 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 17:32:26,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 17:32:26,246 INFO L208 MainTranslator]: Completed translation [2023-08-29 17:32:26,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26 WrapperNode [2023-08-29 17:32:26,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 17:32:26,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 17:32:26,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 17:32:26,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 17:32:26,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,316 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2023-08-29 17:32:26,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 17:32:26,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 17:32:26,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 17:32:26,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 17:32:26,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 17:32:26,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 17:32:26,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 17:32:26,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 17:32:26,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (1/1) ... [2023-08-29 17:32:26,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 17:32:26,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:32:26,414 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) [2023-08-29 17:32:26,429 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 [2023-08-29 17:32:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 17:32:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 17:32:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 17:32:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 17:32:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 17:32:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 17:32:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 17:32:26,454 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 17:32:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 17:32:26,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 17:32:26,456 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 17:32:26,570 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 17:32:26,572 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 17:32:26,834 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 17:32:26,839 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 17:32:26,839 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-29 17:32:26,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 05:32:26 BoogieIcfgContainer [2023-08-29 17:32:26,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 17:32:26,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 17:32:26,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 17:32:26,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 17:32:26,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 05:32:25" (1/3) ... [2023-08-29 17:32:26,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d68a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 05:32:26, skipping insertion in model container [2023-08-29 17:32:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 05:32:26" (2/3) ... [2023-08-29 17:32:26,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d68a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 05:32:26, skipping insertion in model container [2023-08-29 17:32:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 05:32:26" (3/3) ... [2023-08-29 17:32:26,847 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2023-08-29 17:32:26,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 17:32:26,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 17:32:26,861 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-29 17:32:26,862 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 17:32:26,948 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 17:32:26,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 98 transitions, 201 flow [2023-08-29 17:32:27,055 INFO L130 PetriNetUnfolder]: 4/97 cut-off events. [2023-08-29 17:32:27,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 17:32:27,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 4/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-29 17:32:27,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 98 transitions, 201 flow [2023-08-29 17:32:27,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 97 transitions, 197 flow [2023-08-29 17:32:27,068 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 17:32:27,080 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 97 transitions, 197 flow [2023-08-29 17:32:27,082 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 97 transitions, 197 flow [2023-08-29 17:32:27,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 97 transitions, 197 flow [2023-08-29 17:32:27,122 INFO L130 PetriNetUnfolder]: 4/97 cut-off events. [2023-08-29 17:32:27,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 17:32:27,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 4/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-29 17:32:27,126 INFO L119 LiptonReduction]: Number of co-enabled transitions 2088 [2023-08-29 17:32:28,783 INFO L134 LiptonReduction]: Checked pairs total: 7607 [2023-08-29 17:32:28,783 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-29 17:32:28,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 17:32:28,800 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60685894, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 17:32:28,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-29 17:32:28,805 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2023-08-29 17:32:28,805 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 17:32:28,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:28,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:28,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:28,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1950365207, now seen corresponding path program 1 times [2023-08-29 17:32:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314087444] [2023-08-29 17:32:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:28,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314087444] [2023-08-29 17:32:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314087444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:29,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 17:32:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314700157] [2023-08-29 17:32:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:29,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 17:32:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 17:32:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 17:32:29,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 166 [2023-08-29 17:32:29,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:29,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 166 [2023-08-29 17:32:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:29,124 INFO L130 PetriNetUnfolder]: 31/148 cut-off events. [2023-08-29 17:32:29,124 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 17:32:29,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 148 events. 31/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 539 event pairs, 30 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 214. Up to 76 conditions per place. [2023-08-29 17:32:29,126 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-29 17:32:29,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 109 flow [2023-08-29 17:32:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 17:32:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 17:32:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-29 17:32:29,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763052208835341 [2023-08-29 17:32:29,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-29 17:32:29,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-29 17:32:29,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:29,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-29 17:32:29,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,163 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 75 flow. Second operand 3 states and 287 transitions. [2023-08-29 17:32:29,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 109 flow [2023-08-29 17:32:29,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 17:32:29,166 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-08-29 17:32:29,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-29 17:32:29,173 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-29 17:32:29,173 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-08-29 17:32:29,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:29,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:29,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 17:32:29,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:29,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1263490996, now seen corresponding path program 1 times [2023-08-29 17:32:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360701722] [2023-08-29 17:32:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:29,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360701722] [2023-08-29 17:32:29,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360701722] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:32:29,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398866667] [2023-08-29 17:32:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:29,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:32:29,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:32:29,305 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) [2023-08-29 17:32:29,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 17:32:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:29,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 17:32:29,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:32:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:29,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 17:32:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398866667] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 17:32:29,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 17:32:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 17:32:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308020707] [2023-08-29 17:32:29,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 17:32:29,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 17:32:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 17:32:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 17:32:29,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 166 [2023-08-29 17:32:29,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:29,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 166 [2023-08-29 17:32:29,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:29,602 INFO L130 PetriNetUnfolder]: 31/151 cut-off events. [2023-08-29 17:32:29,602 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 17:32:29,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 151 events. 31/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 541 event pairs, 30 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 233. Up to 76 conditions per place. [2023-08-29 17:32:29,604 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-29 17:32:29,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 136 flow [2023-08-29 17:32:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 17:32:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 17:32:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2023-08-29 17:32:29,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5582329317269076 [2023-08-29 17:32:29,607 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 556 transitions. [2023-08-29 17:32:29,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 556 transitions. [2023-08-29 17:32:29,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:29,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 556 transitions. [2023-08-29 17:32:29,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,612 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,612 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 6 states and 556 transitions. [2023-08-29 17:32:29,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 136 flow [2023-08-29 17:32:29,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 132 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 17:32:29,613 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 118 flow [2023-08-29 17:32:29,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-29 17:32:29,614 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-29 17:32:29,614 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 118 flow [2023-08-29 17:32:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:29,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:29,615 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:29,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 17:32:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:32:29,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:29,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1338651991, now seen corresponding path program 2 times [2023-08-29 17:32:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945339741] [2023-08-29 17:32:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 17:32:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945339741] [2023-08-29 17:32:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945339741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:30,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:30,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 17:32:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567345894] [2023-08-29 17:32:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:30,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 17:32:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:30,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 17:32:30,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 17:32:30,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 166 [2023-08-29 17:32:30,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:30,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:30,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 166 [2023-08-29 17:32:30,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:30,659 INFO L130 PetriNetUnfolder]: 148/371 cut-off events. [2023-08-29 17:32:30,660 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 17:32:30,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 371 events. 148/371 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1593 event pairs, 74 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 695. Up to 250 conditions per place. [2023-08-29 17:32:30,663 INFO L137 encePairwiseOnDemand]: 155/166 looper letters, 50 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2023-08-29 17:32:30,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 344 flow [2023-08-29 17:32:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 17:32:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 17:32:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2023-08-29 17:32:30,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271084337349398 [2023-08-29 17:32:30,665 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 525 transitions. [2023-08-29 17:32:30,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 525 transitions. [2023-08-29 17:32:30,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:30,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 525 transitions. [2023-08-29 17:32:30,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:30,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:30,670 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:30,670 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 118 flow. Second operand 6 states and 525 transitions. [2023-08-29 17:32:30,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 344 flow [2023-08-29 17:32:30,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 330 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 17:32:30,672 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 254 flow [2023-08-29 17:32:30,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-29 17:32:30,673 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-29 17:32:30,674 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 254 flow [2023-08-29 17:32:30,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:30,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:30,674 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:30,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 17:32:30,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:30,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2110106231, now seen corresponding path program 1 times [2023-08-29 17:32:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610611869] [2023-08-29 17:32:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 17:32:30,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:30,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610611869] [2023-08-29 17:32:30,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610611869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:30,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 17:32:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413537447] [2023-08-29 17:32:30,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:30,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 17:32:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 17:32:30,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 17:32:31,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 166 [2023-08-29 17:32:31,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:31,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 166 [2023-08-29 17:32:31,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:31,235 INFO L130 PetriNetUnfolder]: 188/465 cut-off events. [2023-08-29 17:32:31,235 INFO L131 PetriNetUnfolder]: For 133/137 co-relation queries the response was YES. [2023-08-29 17:32:31,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 465 events. 188/465 cut-off events. For 133/137 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2178 event pairs, 61 based on Foata normal form. 3/459 useless extension candidates. Maximal degree in co-relation 1074. Up to 299 conditions per place. [2023-08-29 17:32:31,238 INFO L137 encePairwiseOnDemand]: 155/166 looper letters, 65 selfloop transitions, 26 changer transitions 0/103 dead transitions. [2023-08-29 17:32:31,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 546 flow [2023-08-29 17:32:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 17:32:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 17:32:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2023-08-29 17:32:31,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401606425702812 [2023-08-29 17:32:31,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 538 transitions. [2023-08-29 17:32:31,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 538 transitions. [2023-08-29 17:32:31,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:31,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 538 transitions. [2023-08-29 17:32:31,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,245 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 254 flow. Second operand 6 states and 538 transitions. [2023-08-29 17:32:31,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 546 flow [2023-08-29 17:32:31,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 546 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 17:32:31,250 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 438 flow [2023-08-29 17:32:31,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2023-08-29 17:32:31,251 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2023-08-29 17:32:31,251 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 438 flow [2023-08-29 17:32:31,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:31,252 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:31,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 17:32:31,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:31,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1793987561, now seen corresponding path program 1 times [2023-08-29 17:32:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381777644] [2023-08-29 17:32:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:31,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:31,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381777644] [2023-08-29 17:32:31,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381777644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:32:31,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913064652] [2023-08-29 17:32:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:31,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:32:31,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:32:31,336 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) [2023-08-29 17:32:31,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 17:32:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:31,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 17:32:31,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:32:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:31,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 17:32:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913064652] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 17:32:31,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 17:32:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 17:32:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502678081] [2023-08-29 17:32:31,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 17:32:31,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 17:32:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:31,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 17:32:31,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 17:32:31,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 166 [2023-08-29 17:32:31,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 438 flow. Second operand has 13 states, 13 states have (on average 90.46153846153847) internal successors, (1176), 13 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:31,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 166 [2023-08-29 17:32:31,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:31,652 INFO L130 PetriNetUnfolder]: 116/356 cut-off events. [2023-08-29 17:32:31,652 INFO L131 PetriNetUnfolder]: For 271/274 co-relation queries the response was YES. [2023-08-29 17:32:31,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 356 events. 116/356 cut-off events. For 271/274 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1732 event pairs, 38 based on Foata normal form. 7/356 useless extension candidates. Maximal degree in co-relation 882. Up to 139 conditions per place. [2023-08-29 17:32:31,655 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 21 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-29 17:32:31,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 538 flow [2023-08-29 17:32:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 17:32:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 17:32:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1099 transitions. [2023-08-29 17:32:31,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517068273092369 [2023-08-29 17:32:31,660 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1099 transitions. [2023-08-29 17:32:31,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1099 transitions. [2023-08-29 17:32:31,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:31,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1099 transitions. [2023-08-29 17:32:31,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.58333333333333) internal successors, (1099), 12 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,666 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,666 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 438 flow. Second operand 12 states and 1099 transitions. [2023-08-29 17:32:31,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 538 flow [2023-08-29 17:32:31,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 17:32:31,674 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 522 flow [2023-08-29 17:32:31,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2023-08-29 17:32:31,677 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-29 17:32:31,677 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 522 flow [2023-08-29 17:32:31,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.46153846153847) internal successors, (1176), 13 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:31,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:31,678 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:31,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 17:32:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:32:31,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:31,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 46610167, now seen corresponding path program 2 times [2023-08-29 17:32:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197676000] [2023-08-29 17:32:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:31,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:32:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197676000] [2023-08-29 17:32:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197676000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:32,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 17:32:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608247454] [2023-08-29 17:32:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:32,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 17:32:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 17:32:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 17:32:32,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-29 17:32:32,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:32,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:32,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-29 17:32:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:32,562 INFO L130 PetriNetUnfolder]: 291/670 cut-off events. [2023-08-29 17:32:32,562 INFO L131 PetriNetUnfolder]: For 549/557 co-relation queries the response was YES. [2023-08-29 17:32:32,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 670 events. 291/670 cut-off events. For 549/557 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3120 event pairs, 104 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 1992. Up to 545 conditions per place. [2023-08-29 17:32:32,569 INFO L137 encePairwiseOnDemand]: 152/166 looper letters, 89 selfloop transitions, 49 changer transitions 8/151 dead transitions. [2023-08-29 17:32:32,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 151 transitions, 1078 flow [2023-08-29 17:32:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 17:32:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 17:32:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2023-08-29 17:32:32,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100401606425703 [2023-08-29 17:32:32,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2023-08-29 17:32:32,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2023-08-29 17:32:32,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:32,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2023-08-29 17:32:32,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:32,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:32,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:32,576 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 522 flow. Second operand 6 states and 508 transitions. [2023-08-29 17:32:32,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 151 transitions, 1078 flow [2023-08-29 17:32:32,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 151 transitions, 1030 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 17:32:32,583 INFO L231 Difference]: Finished difference. Result has 88 places, 131 transitions, 869 flow [2023-08-29 17:32:32,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=88, PETRI_TRANSITIONS=131} [2023-08-29 17:32:32,585 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2023-08-29 17:32:32,585 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 131 transitions, 869 flow [2023-08-29 17:32:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:32,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:32,586 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 17:32:32,586 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:32,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash -835319141, now seen corresponding path program 1 times [2023-08-29 17:32:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256674587] [2023-08-29 17:32:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:32:32,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256674587] [2023-08-29 17:32:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256674587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:32,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 17:32:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987308513] [2023-08-29 17:32:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:32,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 17:32:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 17:32:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 17:32:33,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 166 [2023-08-29 17:32:33,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 131 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:33,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:33,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 166 [2023-08-29 17:32:33,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:33,250 INFO L130 PetriNetUnfolder]: 350/802 cut-off events. [2023-08-29 17:32:33,251 INFO L131 PetriNetUnfolder]: For 1113/1132 co-relation queries the response was YES. [2023-08-29 17:32:33,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 802 events. 350/802 cut-off events. For 1113/1132 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3990 event pairs, 84 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 2805. Up to 626 conditions per place. [2023-08-29 17:32:33,257 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 124 selfloop transitions, 58 changer transitions 16/203 dead transitions. [2023-08-29 17:32:33,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 203 transitions, 1636 flow [2023-08-29 17:32:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 17:32:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 17:32:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2023-08-29 17:32:33,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230923694779116 [2023-08-29 17:32:33,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 521 transitions. [2023-08-29 17:32:33,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 521 transitions. [2023-08-29 17:32:33,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:33,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 521 transitions. [2023-08-29 17:32:33,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:33,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:33,286 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:33,287 INFO L175 Difference]: Start difference. First operand has 88 places, 131 transitions, 869 flow. Second operand 6 states and 521 transitions. [2023-08-29 17:32:33,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 203 transitions, 1636 flow [2023-08-29 17:32:33,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 203 transitions, 1572 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-29 17:32:33,298 INFO L231 Difference]: Finished difference. Result has 98 places, 175 transitions, 1341 flow [2023-08-29 17:32:33,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1341, PETRI_PLACES=98, PETRI_TRANSITIONS=175} [2023-08-29 17:32:33,299 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2023-08-29 17:32:33,299 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 175 transitions, 1341 flow [2023-08-29 17:32:33,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:33,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:33,300 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:33,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 17:32:33,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:33,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1071622368, now seen corresponding path program 1 times [2023-08-29 17:32:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928680555] [2023-08-29 17:32:33,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:32:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928680555] [2023-08-29 17:32:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928680555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 17:32:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892139026] [2023-08-29 17:32:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:34,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 17:32:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 17:32:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-08-29 17:32:35,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-29 17:32:35,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 175 transitions, 1341 flow. Second operand has 10 states, 10 states have (on average 71.4) internal successors, (714), 10 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:35,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:35,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-29 17:32:35,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:35,920 INFO L130 PetriNetUnfolder]: 603/1428 cut-off events. [2023-08-29 17:32:35,920 INFO L131 PetriNetUnfolder]: For 3094/3137 co-relation queries the response was YES. [2023-08-29 17:32:35,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 1428 events. 603/1428 cut-off events. For 3094/3137 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9094 event pairs, 41 based on Foata normal form. 8/1433 useless extension candidates. Maximal degree in co-relation 5918. Up to 453 conditions per place. [2023-08-29 17:32:35,934 INFO L137 encePairwiseOnDemand]: 150/166 looper letters, 286 selfloop transitions, 81 changer transitions 41/436 dead transitions. [2023-08-29 17:32:35,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 436 transitions, 4051 flow [2023-08-29 17:32:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-29 17:32:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-29 17:32:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2023-08-29 17:32:35,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47200566973777464 [2023-08-29 17:32:35,938 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1332 transitions. [2023-08-29 17:32:35,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1332 transitions. [2023-08-29 17:32:35,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:35,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1332 transitions. [2023-08-29 17:32:35,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 78.3529411764706) internal successors, (1332), 17 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:35,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:35,972 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:35,973 INFO L175 Difference]: Start difference. First operand has 98 places, 175 transitions, 1341 flow. Second operand 17 states and 1332 transitions. [2023-08-29 17:32:35,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 436 transitions, 4051 flow [2023-08-29 17:32:35,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 436 transitions, 3909 flow, removed 71 selfloop flow, removed 0 redundant places. [2023-08-29 17:32:36,002 INFO L231 Difference]: Finished difference. Result has 127 places, 242 transitions, 2187 flow [2023-08-29 17:32:36,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2187, PETRI_PLACES=127, PETRI_TRANSITIONS=242} [2023-08-29 17:32:36,003 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2023-08-29 17:32:36,004 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 242 transitions, 2187 flow [2023-08-29 17:32:36,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.4) internal successors, (714), 10 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:36,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:36,004 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:36,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 17:32:36,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:36,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1227228932, now seen corresponding path program 2 times [2023-08-29 17:32:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967604843] [2023-08-29 17:32:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:36,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:32:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967604843] [2023-08-29 17:32:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967604843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:32:36,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:32:36,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:32:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522607297] [2023-08-29 17:32:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:36,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:32:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:32:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:32:36,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-29 17:32:36,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 242 transitions, 2187 flow. Second operand has 9 states, 9 states have (on average 71.55555555555556) internal successors, (644), 9 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:36,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:36,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-29 17:32:36,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:32:37,449 INFO L130 PetriNetUnfolder]: 608/1488 cut-off events. [2023-08-29 17:32:37,450 INFO L131 PetriNetUnfolder]: For 5062/5115 co-relation queries the response was YES. [2023-08-29 17:32:37,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6939 conditions, 1488 events. 608/1488 cut-off events. For 5062/5115 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9701 event pairs, 34 based on Foata normal form. 13/1498 useless extension candidates. Maximal degree in co-relation 6855. Up to 499 conditions per place. [2023-08-29 17:32:37,466 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 269 selfloop transitions, 83 changer transitions 29/409 dead transitions. [2023-08-29 17:32:37,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 409 transitions, 4201 flow [2023-08-29 17:32:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 17:32:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 17:32:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2023-08-29 17:32:37,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.499330655957162 [2023-08-29 17:32:37,469 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 746 transitions. [2023-08-29 17:32:37,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 746 transitions. [2023-08-29 17:32:37,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:32:37,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 746 transitions. [2023-08-29 17:32:37,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:37,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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) [2023-08-29 17:32:37,474 INFO L81 ComplementDD]: Finished complementDD. Result 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) [2023-08-29 17:32:37,474 INFO L175 Difference]: Start difference. First operand has 127 places, 242 transitions, 2187 flow. Second operand 9 states and 746 transitions. [2023-08-29 17:32:37,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 409 transitions, 4201 flow [2023-08-29 17:32:37,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 409 transitions, 4187 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-29 17:32:37,510 INFO L231 Difference]: Finished difference. Result has 141 places, 276 transitions, 2871 flow [2023-08-29 17:32:37,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2871, PETRI_PLACES=141, PETRI_TRANSITIONS=276} [2023-08-29 17:32:37,511 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 102 predicate places. [2023-08-29 17:32:37,511 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 276 transitions, 2871 flow [2023-08-29 17:32:37,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.55555555555556) internal successors, (644), 9 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:37,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:32:37,512 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:32:37,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 17:32:37,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:32:37,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:32:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash -535616722, now seen corresponding path program 1 times [2023-08-29 17:32:37,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:32:37,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650698574] [2023-08-29 17:32:37,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:32:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:32:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:32:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650698574] [2023-08-29 17:32:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650698574] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:32:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666651451] [2023-08-29 17:32:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:32:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:32:43,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:32:43,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 17:32:43,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 17:32:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:32:43,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-29 17:32:43,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:32:43,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 17:32:44,086 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 17:32:44,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2023-08-29 17:32:44,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-29 17:32:44,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-29 17:32:44,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 17:32:44,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-29 17:32:44,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:32:44,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:32:44,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:32:44,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 17:32:44,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2023-08-29 17:32:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-29 17:32:47,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 17:32:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:32:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666651451] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 17:32:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 17:32:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18, 13] total 38 [2023-08-29 17:32:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013582892] [2023-08-29 17:32:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:32:53,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:32:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:32:53,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:32:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1308, Unknown=2, NotChecked=0, Total=1482 [2023-08-29 17:32:55,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 17:32:55,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 276 transitions, 2871 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:32:55,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:32:55,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 17:32:55,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:04,503 INFO L130 PetriNetUnfolder]: 593/1472 cut-off events. [2023-08-29 17:33:04,503 INFO L131 PetriNetUnfolder]: For 7095/7151 co-relation queries the response was YES. [2023-08-29 17:33:04,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1472 events. 593/1472 cut-off events. For 7095/7151 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9596 event pairs, 51 based on Foata normal form. 16/1485 useless extension candidates. Maximal degree in co-relation 7382. Up to 476 conditions per place. [2023-08-29 17:33:04,527 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 281 selfloop transitions, 83 changer transitions 42/469 dead transitions. [2023-08-29 17:33:04,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 469 transitions, 5146 flow [2023-08-29 17:33:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 17:33:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 17:33:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1198 transitions. [2023-08-29 17:33:04,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811244979919679 [2023-08-29 17:33:04,536 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1198 transitions. [2023-08-29 17:33:04,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1198 transitions. [2023-08-29 17:33:04,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:04,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1198 transitions. [2023-08-29 17:33:04,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 79.86666666666666) internal successors, (1198), 15 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:04,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:04,543 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:04,543 INFO L175 Difference]: Start difference. First operand has 141 places, 276 transitions, 2871 flow. Second operand 15 states and 1198 transitions. [2023-08-29 17:33:04,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 469 transitions, 5146 flow [2023-08-29 17:33:04,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 469 transitions, 5082 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-29 17:33:04,599 INFO L231 Difference]: Finished difference. Result has 165 places, 332 transitions, 3674 flow [2023-08-29 17:33:04,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3674, PETRI_PLACES=165, PETRI_TRANSITIONS=332} [2023-08-29 17:33:04,601 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 126 predicate places. [2023-08-29 17:33:04,601 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 332 transitions, 3674 flow [2023-08-29 17:33:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:04,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:04,601 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:04,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-29 17:33:04,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:33:04,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:04,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 448036598, now seen corresponding path program 3 times [2023-08-29 17:33:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259571439] [2023-08-29 17:33:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259571439] [2023-08-29 17:33:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259571439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262590061] [2023-08-29 17:33:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:06,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 17:33:06,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 332 transitions, 3674 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:06,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:06,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 17:33:06,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:06,806 INFO L130 PetriNetUnfolder]: 587/1453 cut-off events. [2023-08-29 17:33:06,806 INFO L131 PetriNetUnfolder]: For 8427/8485 co-relation queries the response was YES. [2023-08-29 17:33:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1453 events. 587/1453 cut-off events. For 8427/8485 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9530 event pairs, 34 based on Foata normal form. 17/1466 useless extension candidates. Maximal degree in co-relation 7797. Up to 486 conditions per place. [2023-08-29 17:33:06,819 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 293 selfloop transitions, 86 changer transitions 36/456 dead transitions. [2023-08-29 17:33:06,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 456 transitions, 5489 flow [2023-08-29 17:33:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 17:33:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 17:33:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1193 transitions. [2023-08-29 17:33:06,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791164658634538 [2023-08-29 17:33:06,822 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1193 transitions. [2023-08-29 17:33:06,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1193 transitions. [2023-08-29 17:33:06,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:06,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1193 transitions. [2023-08-29 17:33:06,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 79.53333333333333) internal successors, (1193), 15 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:06,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:06,830 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:06,830 INFO L175 Difference]: Start difference. First operand has 165 places, 332 transitions, 3674 flow. Second operand 15 states and 1193 transitions. [2023-08-29 17:33:06,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 456 transitions, 5489 flow [2023-08-29 17:33:06,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 456 transitions, 5463 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-29 17:33:06,887 INFO L231 Difference]: Finished difference. Result has 176 places, 342 transitions, 4074 flow [2023-08-29 17:33:06,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=3656, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4074, PETRI_PLACES=176, PETRI_TRANSITIONS=342} [2023-08-29 17:33:06,888 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 137 predicate places. [2023-08-29 17:33:06,888 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 342 transitions, 4074 flow [2023-08-29 17:33:06,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:06,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:06,889 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:06,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 17:33:06,889 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:06,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:06,890 INFO L85 PathProgramCache]: Analyzing trace with hash -308912082, now seen corresponding path program 2 times [2023-08-29 17:33:06,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:06,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847020053] [2023-08-29 17:33:06,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:06,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:07,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847020053] [2023-08-29 17:33:07,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847020053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:07,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:07,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 17:33:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611945205] [2023-08-29 17:33:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:07,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 17:33:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 17:33:07,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-29 17:33:08,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 166 [2023-08-29 17:33:08,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 342 transitions, 4074 flow. Second operand has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:08,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:08,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 166 [2023-08-29 17:33:08,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:09,398 INFO L130 PetriNetUnfolder]: 624/1531 cut-off events. [2023-08-29 17:33:09,398 INFO L131 PetriNetUnfolder]: For 11050/11128 co-relation queries the response was YES. [2023-08-29 17:33:09,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 1531 events. 624/1531 cut-off events. For 11050/11128 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10125 event pairs, 65 based on Foata normal form. 22/1549 useless extension candidates. Maximal degree in co-relation 8711. Up to 906 conditions per place. [2023-08-29 17:33:09,413 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 261 selfloop transitions, 114 changer transitions 36/459 dead transitions. [2023-08-29 17:33:09,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 459 transitions, 6144 flow [2023-08-29 17:33:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 17:33:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 17:33:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 803 transitions. [2023-08-29 17:33:09,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48373493975903614 [2023-08-29 17:33:09,416 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 803 transitions. [2023-08-29 17:33:09,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 803 transitions. [2023-08-29 17:33:09,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:09,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 803 transitions. [2023-08-29 17:33:09,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.3) internal successors, (803), 10 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:09,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:09,422 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:09,422 INFO L175 Difference]: Start difference. First operand has 176 places, 342 transitions, 4074 flow. Second operand 10 states and 803 transitions. [2023-08-29 17:33:09,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 459 transitions, 6144 flow [2023-08-29 17:33:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 459 transitions, 5984 flow, removed 41 selfloop flow, removed 4 redundant places. [2023-08-29 17:33:09,476 INFO L231 Difference]: Finished difference. Result has 185 places, 366 transitions, 4796 flow [2023-08-29 17:33:09,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=3944, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4796, PETRI_PLACES=185, PETRI_TRANSITIONS=366} [2023-08-29 17:33:09,477 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 146 predicate places. [2023-08-29 17:33:09,477 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 366 transitions, 4796 flow [2023-08-29 17:33:09,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:09,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:09,478 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 17:33:09,478 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:09,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1222085252, now seen corresponding path program 3 times [2023-08-29 17:33:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685150538] [2023-08-29 17:33:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685150538] [2023-08-29 17:33:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685150538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756119723] [2023-08-29 17:33:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:10,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:10,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:10,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 17:33:10,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 366 transitions, 4796 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:10,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:10,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 17:33:10,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:11,438 INFO L130 PetriNetUnfolder]: 613/1529 cut-off events. [2023-08-29 17:33:11,439 INFO L131 PetriNetUnfolder]: For 14024/14094 co-relation queries the response was YES. [2023-08-29 17:33:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9400 conditions, 1529 events. 613/1529 cut-off events. For 14024/14094 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10224 event pairs, 57 based on Foata normal form. 17/1536 useless extension candidates. Maximal degree in co-relation 9296. Up to 516 conditions per place. [2023-08-29 17:33:11,456 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 312 selfloop transitions, 104 changer transitions 25/506 dead transitions. [2023-08-29 17:33:11,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 506 transitions, 6965 flow [2023-08-29 17:33:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 17:33:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 17:33:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 825 transitions. [2023-08-29 17:33:11,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49698795180722893 [2023-08-29 17:33:11,461 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 825 transitions. [2023-08-29 17:33:11,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 825 transitions. [2023-08-29 17:33:11,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:11,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 825 transitions. [2023-08-29 17:33:11,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.5) internal successors, (825), 10 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:11,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:11,465 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:11,466 INFO L175 Difference]: Start difference. First operand has 185 places, 366 transitions, 4796 flow. Second operand 10 states and 825 transitions. [2023-08-29 17:33:11,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 506 transitions, 6965 flow [2023-08-29 17:33:11,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 506 transitions, 6905 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-29 17:33:11,528 INFO L231 Difference]: Finished difference. Result has 195 places, 390 transitions, 5454 flow [2023-08-29 17:33:11,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=4742, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5454, PETRI_PLACES=195, PETRI_TRANSITIONS=390} [2023-08-29 17:33:11,529 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 156 predicate places. [2023-08-29 17:33:11,529 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 390 transitions, 5454 flow [2023-08-29 17:33:11,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:11,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:11,530 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:11,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 17:33:11,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:11,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2052644462, now seen corresponding path program 4 times [2023-08-29 17:33:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694053691] [2023-08-29 17:33:11,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:13,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694053691] [2023-08-29 17:33:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694053691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:13,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 17:33:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822897112] [2023-08-29 17:33:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 17:33:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 17:33:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-29 17:33:13,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 166 [2023-08-29 17:33:13,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 390 transitions, 5454 flow. Second operand has 11 states, 11 states have (on average 69.45454545454545) internal successors, (764), 11 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:13,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:13,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 166 [2023-08-29 17:33:13,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:14,889 INFO L130 PetriNetUnfolder]: 692/1704 cut-off events. [2023-08-29 17:33:14,889 INFO L131 PetriNetUnfolder]: For 18631/18717 co-relation queries the response was YES. [2023-08-29 17:33:14,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11146 conditions, 1704 events. 692/1704 cut-off events. For 18631/18717 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11614 event pairs, 60 based on Foata normal form. 22/1722 useless extension candidates. Maximal degree in co-relation 11036. Up to 951 conditions per place. [2023-08-29 17:33:14,905 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 287 selfloop transitions, 165 changer transitions 21/521 dead transitions. [2023-08-29 17:33:14,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 521 transitions, 8031 flow [2023-08-29 17:33:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 17:33:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 17:33:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 936 transitions. [2023-08-29 17:33:14,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987951807228917 [2023-08-29 17:33:14,907 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 936 transitions. [2023-08-29 17:33:14,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 936 transitions. [2023-08-29 17:33:14,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:14,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 936 transitions. [2023-08-29 17:33:14,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 78.0) internal successors, (936), 12 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:14,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:14,912 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:14,912 INFO L175 Difference]: Start difference. First operand has 195 places, 390 transitions, 5454 flow. Second operand 12 states and 936 transitions. [2023-08-29 17:33:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 521 transitions, 8031 flow [2023-08-29 17:33:14,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 521 transitions, 7959 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-08-29 17:33:14,991 INFO L231 Difference]: Finished difference. Result has 214 places, 436 transitions, 6857 flow [2023-08-29 17:33:14,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=5384, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6857, PETRI_PLACES=214, PETRI_TRANSITIONS=436} [2023-08-29 17:33:14,991 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 175 predicate places. [2023-08-29 17:33:14,992 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 436 transitions, 6857 flow [2023-08-29 17:33:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.45454545454545) internal successors, (764), 11 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:14,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:14,992 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:14,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 17:33:14,992 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:14,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2135421222, now seen corresponding path program 1 times [2023-08-29 17:33:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675532070] [2023-08-29 17:33:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675532070] [2023-08-29 17:33:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675532070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327928014] [2023-08-29 17:33:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:15,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:15,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:33:15,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 436 transitions, 6857 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:15,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:15,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:33:15,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:16,522 INFO L130 PetriNetUnfolder]: 808/1923 cut-off events. [2023-08-29 17:33:16,522 INFO L131 PetriNetUnfolder]: For 26893/26933 co-relation queries the response was YES. [2023-08-29 17:33:16,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13594 conditions, 1923 events. 808/1923 cut-off events. For 26893/26933 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12758 event pairs, 163 based on Foata normal form. 1/1875 useless extension candidates. Maximal degree in co-relation 13468. Up to 1321 conditions per place. [2023-08-29 17:33:16,540 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 312 selfloop transitions, 168 changer transitions 29/514 dead transitions. [2023-08-29 17:33:16,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 514 transitions, 8742 flow [2023-08-29 17:33:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 17:33:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 17:33:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 617 transitions. [2023-08-29 17:33:16,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46460843373493976 [2023-08-29 17:33:16,542 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 617 transitions. [2023-08-29 17:33:16,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 617 transitions. [2023-08-29 17:33:16,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:16,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 617 transitions. [2023-08-29 17:33:16,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.125) internal successors, (617), 8 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:16,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:16,545 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:16,545 INFO L175 Difference]: Start difference. First operand has 214 places, 436 transitions, 6857 flow. Second operand 8 states and 617 transitions. [2023-08-29 17:33:16,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 514 transitions, 8742 flow [2023-08-29 17:33:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 514 transitions, 8641 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-29 17:33:16,671 INFO L231 Difference]: Finished difference. Result has 222 places, 453 transitions, 7397 flow [2023-08-29 17:33:16,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=6764, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7397, PETRI_PLACES=222, PETRI_TRANSITIONS=453} [2023-08-29 17:33:16,672 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 183 predicate places. [2023-08-29 17:33:16,672 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 453 transitions, 7397 flow [2023-08-29 17:33:16,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:16,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:16,673 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:16,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 17:33:16,673 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:16,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 275868054, now seen corresponding path program 5 times [2023-08-29 17:33:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115216166] [2023-08-29 17:33:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:17,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115216166] [2023-08-29 17:33:17,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115216166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:17,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:17,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:17,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963863956] [2023-08-29 17:33:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:17,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:17,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:17,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:18,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 17:33:18,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 453 transitions, 7397 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:18,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:18,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 17:33:18,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:19,018 INFO L130 PetriNetUnfolder]: 749/1848 cut-off events. [2023-08-29 17:33:19,018 INFO L131 PetriNetUnfolder]: For 30104/30209 co-relation queries the response was YES. [2023-08-29 17:33:19,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13546 conditions, 1848 events. 749/1848 cut-off events. For 30104/30209 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12974 event pairs, 69 based on Foata normal form. 32/1866 useless extension candidates. Maximal degree in co-relation 13421. Up to 915 conditions per place. [2023-08-29 17:33:19,041 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 325 selfloop transitions, 177 changer transitions 23/599 dead transitions. [2023-08-29 17:33:19,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 599 transitions, 10531 flow [2023-08-29 17:33:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 17:33:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 17:33:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2023-08-29 17:33:19,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49866131191432395 [2023-08-29 17:33:19,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2023-08-29 17:33:19,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2023-08-29 17:33:19,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:19,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2023-08-29 17:33:19,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:19,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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) [2023-08-29 17:33:19,047 INFO L81 ComplementDD]: Finished complementDD. Result 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) [2023-08-29 17:33:19,047 INFO L175 Difference]: Start difference. First operand has 222 places, 453 transitions, 7397 flow. Second operand 9 states and 745 transitions. [2023-08-29 17:33:19,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 599 transitions, 10531 flow [2023-08-29 17:33:19,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 599 transitions, 10390 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 17:33:19,244 INFO L231 Difference]: Finished difference. Result has 235 places, 502 transitions, 9025 flow [2023-08-29 17:33:19,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=7281, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9025, PETRI_PLACES=235, PETRI_TRANSITIONS=502} [2023-08-29 17:33:19,244 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 196 predicate places. [2023-08-29 17:33:19,244 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 502 transitions, 9025 flow [2023-08-29 17:33:19,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:19,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:19,245 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:19,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 17:33:19,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:19,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 339846000, now seen corresponding path program 2 times [2023-08-29 17:33:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:19,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366085968] [2023-08-29 17:33:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366085968] [2023-08-29 17:33:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366085968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:19,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:19,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129747375] [2023-08-29 17:33:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:19,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:19,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:20,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:33:20,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 502 transitions, 9025 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:20,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:20,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:33:20,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:20,944 INFO L130 PetriNetUnfolder]: 893/2125 cut-off events. [2023-08-29 17:33:20,944 INFO L131 PetriNetUnfolder]: For 41007/41060 co-relation queries the response was YES. [2023-08-29 17:33:20,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16453 conditions, 2125 events. 893/2125 cut-off events. For 41007/41060 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14608 event pairs, 175 based on Foata normal form. 6/2130 useless extension candidates. Maximal degree in co-relation 16316. Up to 1481 conditions per place. [2023-08-29 17:33:20,966 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 362 selfloop transitions, 183 changer transitions 13/563 dead transitions. [2023-08-29 17:33:20,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 563 transitions, 10851 flow [2023-08-29 17:33:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 17:33:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 17:33:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 604 transitions. [2023-08-29 17:33:20,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45481927710843373 [2023-08-29 17:33:20,969 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 604 transitions. [2023-08-29 17:33:20,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 604 transitions. [2023-08-29 17:33:20,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:20,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 604 transitions. [2023-08-29 17:33:20,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.5) internal successors, (604), 8 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:20,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:20,972 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:20,972 INFO L175 Difference]: Start difference. First operand has 235 places, 502 transitions, 9025 flow. Second operand 8 states and 604 transitions. [2023-08-29 17:33:20,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 563 transitions, 10851 flow [2023-08-29 17:33:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 563 transitions, 10769 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-29 17:33:21,238 INFO L231 Difference]: Finished difference. Result has 245 places, 523 transitions, 9809 flow [2023-08-29 17:33:21,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=8943, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9809, PETRI_PLACES=245, PETRI_TRANSITIONS=523} [2023-08-29 17:33:21,239 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 206 predicate places. [2023-08-29 17:33:21,239 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 523 transitions, 9809 flow [2023-08-29 17:33:21,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:21,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:21,240 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:21,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 17:33:21,240 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:21,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1652558750, now seen corresponding path program 3 times [2023-08-29 17:33:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268805421] [2023-08-29 17:33:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268805421] [2023-08-29 17:33:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268805421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813941504] [2023-08-29 17:33:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:21,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:21,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:33:21,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 523 transitions, 9809 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:21,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:21,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:33:21,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:22,858 INFO L130 PetriNetUnfolder]: 907/2157 cut-off events. [2023-08-29 17:33:22,858 INFO L131 PetriNetUnfolder]: For 46752/46811 co-relation queries the response was YES. [2023-08-29 17:33:22,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 2157 events. 907/2157 cut-off events. For 46752/46811 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14828 event pairs, 168 based on Foata normal form. 5/2161 useless extension candidates. Maximal degree in co-relation 17125. Up to 945 conditions per place. [2023-08-29 17:33:22,881 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 397 selfloop transitions, 244 changer transitions 22/668 dead transitions. [2023-08-29 17:33:22,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 668 transitions, 12670 flow [2023-08-29 17:33:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 17:33:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 17:33:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1034 transitions. [2023-08-29 17:33:22,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47914735866543096 [2023-08-29 17:33:22,886 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1034 transitions. [2023-08-29 17:33:22,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1034 transitions. [2023-08-29 17:33:22,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:22,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1034 transitions. [2023-08-29 17:33:22,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 79.53846153846153) internal successors, (1034), 13 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:22,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:22,891 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:22,891 INFO L175 Difference]: Start difference. First operand has 245 places, 523 transitions, 9809 flow. Second operand 13 states and 1034 transitions. [2023-08-29 17:33:22,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 668 transitions, 12670 flow [2023-08-29 17:33:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 668 transitions, 12620 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-29 17:33:23,163 INFO L231 Difference]: Finished difference. Result has 260 places, 563 transitions, 11041 flow [2023-08-29 17:33:23,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=9763, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11041, PETRI_PLACES=260, PETRI_TRANSITIONS=563} [2023-08-29 17:33:23,164 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 221 predicate places. [2023-08-29 17:33:23,164 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 563 transitions, 11041 flow [2023-08-29 17:33:23,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:23,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:23,164 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:23,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 17:33:23,164 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:23,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 382165376, now seen corresponding path program 4 times [2023-08-29 17:33:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082699117] [2023-08-29 17:33:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082699117] [2023-08-29 17:33:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082699117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:23,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-08-29 17:33:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106379636] [2023-08-29 17:33:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:23,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 17:33:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:23,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 17:33:23,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-08-29 17:33:24,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 166 [2023-08-29 17:33:24,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 563 transitions, 11041 flow. Second operand has 14 states, 14 states have (on average 58.357142857142854) internal successors, (817), 14 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:24,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:24,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 166 [2023-08-29 17:33:24,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:26,020 INFO L130 PetriNetUnfolder]: 1413/3198 cut-off events. [2023-08-29 17:33:26,020 INFO L131 PetriNetUnfolder]: For 71060/71132 co-relation queries the response was YES. [2023-08-29 17:33:26,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26743 conditions, 3198 events. 1413/3198 cut-off events. For 71060/71132 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23259 event pairs, 173 based on Foata normal form. 5/3202 useless extension candidates. Maximal degree in co-relation 26598. Up to 1184 conditions per place. [2023-08-29 17:33:26,052 INFO L137 encePairwiseOnDemand]: 145/166 looper letters, 768 selfloop transitions, 253 changer transitions 25/1050 dead transitions. [2023-08-29 17:33:26,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1050 transitions, 21132 flow [2023-08-29 17:33:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 17:33:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 17:33:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1451 transitions. [2023-08-29 17:33:26,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41623637406769937 [2023-08-29 17:33:26,056 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1451 transitions. [2023-08-29 17:33:26,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1451 transitions. [2023-08-29 17:33:26,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:26,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1451 transitions. [2023-08-29 17:33:26,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 69.0952380952381) internal successors, (1451), 21 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:26,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 166.0) internal successors, (3652), 22 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:26,063 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 166.0) internal successors, (3652), 22 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:26,063 INFO L175 Difference]: Start difference. First operand has 260 places, 563 transitions, 11041 flow. Second operand 21 states and 1451 transitions. [2023-08-29 17:33:26,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1050 transitions, 21132 flow [2023-08-29 17:33:26,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1050 transitions, 20728 flow, removed 198 selfloop flow, removed 1 redundant places. [2023-08-29 17:33:26,369 INFO L231 Difference]: Finished difference. Result has 292 places, 741 transitions, 15065 flow [2023-08-29 17:33:26,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=10895, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=15065, PETRI_PLACES=292, PETRI_TRANSITIONS=741} [2023-08-29 17:33:26,370 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 253 predicate places. [2023-08-29 17:33:26,370 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 741 transitions, 15065 flow [2023-08-29 17:33:26,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 58.357142857142854) internal successors, (817), 14 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:26,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:26,371 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:26,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 17:33:26,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:26,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1639249436, now seen corresponding path program 6 times [2023-08-29 17:33:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80583127] [2023-08-29 17:33:26,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:33:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:33:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:33:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80583127] [2023-08-29 17:33:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80583127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:33:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:33:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:33:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030070664] [2023-08-29 17:33:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:33:27,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:33:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:33:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:33:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:33:27,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 17:33:27,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 741 transitions, 15065 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:27,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:33:27,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 17:33:27,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:33:29,272 INFO L130 PetriNetUnfolder]: 1119/2750 cut-off events. [2023-08-29 17:33:29,273 INFO L131 PetriNetUnfolder]: For 78997/79280 co-relation queries the response was YES. [2023-08-29 17:33:29,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25029 conditions, 2750 events. 1119/2750 cut-off events. For 78997/79280 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21271 event pairs, 51 based on Foata normal form. 36/2774 useless extension candidates. Maximal degree in co-relation 24870. Up to 1606 conditions per place. [2023-08-29 17:33:29,308 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 480 selfloop transitions, 225 changer transitions 21/867 dead transitions. [2023-08-29 17:33:29,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 867 transitions, 18594 flow [2023-08-29 17:33:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 17:33:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 17:33:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2023-08-29 17:33:29,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49732262382864795 [2023-08-29 17:33:29,310 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2023-08-29 17:33:29,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2023-08-29 17:33:29,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:33:29,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2023-08-29 17:33:29,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.55555555555556) internal successors, (743), 9 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:29,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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) [2023-08-29 17:33:29,313 INFO L81 ComplementDD]: Finished complementDD. Result 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) [2023-08-29 17:33:29,313 INFO L175 Difference]: Start difference. First operand has 292 places, 741 transitions, 15065 flow. Second operand 9 states and 743 transitions. [2023-08-29 17:33:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 867 transitions, 18594 flow [2023-08-29 17:33:29,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 867 transitions, 18504 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-08-29 17:33:29,670 INFO L231 Difference]: Finished difference. Result has 306 places, 779 transitions, 16974 flow [2023-08-29 17:33:29,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=14977, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16974, PETRI_PLACES=306, PETRI_TRANSITIONS=779} [2023-08-29 17:33:29,671 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 267 predicate places. [2023-08-29 17:33:29,671 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 779 transitions, 16974 flow [2023-08-29 17:33:29,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:33:29,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:33:29,671 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:33:29,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 17:33:29,672 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:33:29,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:33:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1834866135, now seen corresponding path program 1 times [2023-08-29 17:33:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:33:29,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388482300] [2023-08-29 17:33:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:33:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:33:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:35:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:35:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388482300] [2023-08-29 17:35:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388482300] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:35:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746924259] [2023-08-29 17:35:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:35:18,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:35:18,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:35:18,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 17:35:18,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 17:35:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:18,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-29 17:35:18,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:35:18,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-29 17:35:18,587 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 17:35:18,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2023-08-29 17:35:18,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 17:35:18,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 17:35:18,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 17:35:18,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-29 17:35:19,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:35:19,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 17:35:19,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2023-08-29 17:35:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-29 17:35:19,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 17:35:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:35:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746924259] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 17:35:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 17:35:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 11] total 35 [2023-08-29 17:35:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377469869] [2023-08-29 17:35:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:35:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:35:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:35:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:35:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2023-08-29 17:35:22,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:35:22,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 779 transitions, 16974 flow. Second operand has 9 states, 9 states have (on average 67.11111111111111) internal successors, (604), 9 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:22,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:35:22,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:35:22,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:35:26,549 INFO L130 PetriNetUnfolder]: 1261/3030 cut-off events. [2023-08-29 17:35:26,549 INFO L131 PetriNetUnfolder]: For 93037/93215 co-relation queries the response was YES. [2023-08-29 17:35:26,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28731 conditions, 3030 events. 1261/3030 cut-off events. For 93037/93215 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22964 event pairs, 185 based on Foata normal form. 11/3041 useless extension candidates. Maximal degree in co-relation 28565. Up to 1495 conditions per place. [2023-08-29 17:35:26,589 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 687 selfloop transitions, 196 changer transitions 44/937 dead transitions. [2023-08-29 17:35:26,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 937 transitions, 21274 flow [2023-08-29 17:35:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 17:35:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 17:35:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1131 transitions. [2023-08-29 17:35:26,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542168674698795 [2023-08-29 17:35:26,591 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1131 transitions. [2023-08-29 17:35:26,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1131 transitions. [2023-08-29 17:35:26,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:35:26,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1131 transitions. [2023-08-29 17:35:26,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 75.4) internal successors, (1131), 15 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:26,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:26,595 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:26,595 INFO L175 Difference]: Start difference. First operand has 306 places, 779 transitions, 16974 flow. Second operand 15 states and 1131 transitions. [2023-08-29 17:35:26,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 937 transitions, 21274 flow [2023-08-29 17:35:26,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 937 transitions, 21157 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-08-29 17:35:27,013 INFO L231 Difference]: Finished difference. Result has 326 places, 838 transitions, 18400 flow [2023-08-29 17:35:27,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=16868, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=18400, PETRI_PLACES=326, PETRI_TRANSITIONS=838} [2023-08-29 17:35:27,014 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 287 predicate places. [2023-08-29 17:35:27,014 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 838 transitions, 18400 flow [2023-08-29 17:35:27,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.11111111111111) internal successors, (604), 9 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:27,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:35:27,014 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:35:27,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 17:35:27,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:35:27,215 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:35:27,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:35:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash 643269942, now seen corresponding path program 5 times [2023-08-29 17:35:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:35:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97091173] [2023-08-29 17:35:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:35:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:35:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:35:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:35:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97091173] [2023-08-29 17:35:29,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97091173] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:35:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756505875] [2023-08-29 17:35:29,745 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 17:35:29,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:35:29,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:35:29,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 17:35:29,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 17:35:29,869 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 17:35:29,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 17:35:29,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-29 17:35:29,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:35:30,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-29 17:35:30,136 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 17:35:30,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2023-08-29 17:35:30,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-29 17:35:30,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-29 17:35:30,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 17:35:30,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-29 17:35:30,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:35:30,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:35:30,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:35:30,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 17:35:30,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2023-08-29 17:35:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 17:35:36,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 17:35:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:35:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756505875] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 17:35:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 17:35:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 16] total 41 [2023-08-29 17:35:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212769531] [2023-08-29 17:35:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:35:39,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:35:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:35:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:35:39,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1537, Unknown=3, NotChecked=0, Total=1722 [2023-08-29 17:35:41,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:35:41,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 838 transitions, 18400 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:41,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:35:41,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:35:41,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:35:46,771 INFO L130 PetriNetUnfolder]: 1284/3055 cut-off events. [2023-08-29 17:35:46,772 INFO L131 PetriNetUnfolder]: For 96219/96287 co-relation queries the response was YES. [2023-08-29 17:35:46,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30034 conditions, 3055 events. 1284/3055 cut-off events. For 96219/96287 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23020 event pairs, 207 based on Foata normal form. 13/3067 useless extension candidates. Maximal degree in co-relation 29861. Up to 1612 conditions per place. [2023-08-29 17:35:46,811 INFO L137 encePairwiseOnDemand]: 150/166 looper letters, 555 selfloop transitions, 335 changer transitions 14/914 dead transitions. [2023-08-29 17:35:46,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 914 transitions, 21360 flow [2023-08-29 17:35:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 17:35:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 17:35:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2023-08-29 17:35:46,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47925033467202144 [2023-08-29 17:35:46,812 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 716 transitions. [2023-08-29 17:35:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 716 transitions. [2023-08-29 17:35:46,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:35:46,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 716 transitions. [2023-08-29 17:35:46,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.55555555555556) internal successors, (716), 9 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:46,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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) [2023-08-29 17:35:46,814 INFO L81 ComplementDD]: Finished complementDD. Result 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) [2023-08-29 17:35:46,815 INFO L175 Difference]: Start difference. First operand has 326 places, 838 transitions, 18400 flow. Second operand 9 states and 716 transitions. [2023-08-29 17:35:46,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 914 transitions, 21360 flow [2023-08-29 17:35:47,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 914 transitions, 21150 flow, removed 101 selfloop flow, removed 3 redundant places. [2023-08-29 17:35:47,274 INFO L231 Difference]: Finished difference. Result has 329 places, 859 transitions, 19464 flow [2023-08-29 17:35:47,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=18194, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19464, PETRI_PLACES=329, PETRI_TRANSITIONS=859} [2023-08-29 17:35:47,275 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 290 predicate places. [2023-08-29 17:35:47,275 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 859 transitions, 19464 flow [2023-08-29 17:35:47,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:47,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:35:47,275 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:35:47,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-29 17:35:47,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-29 17:35:47,481 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:35:47,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:35:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1293712730, now seen corresponding path program 6 times [2023-08-29 17:35:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:35:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20467226] [2023-08-29 17:35:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:35:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:35:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:35:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:35:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20467226] [2023-08-29 17:35:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20467226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:35:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:35:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:35:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216776783] [2023-08-29 17:35:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:35:47,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:35:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:35:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:35:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:35:48,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:35:48,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 859 transitions, 19464 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:48,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:35:48,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:35:48,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:35:49,257 INFO L130 PetriNetUnfolder]: 1285/3058 cut-off events. [2023-08-29 17:35:49,257 INFO L131 PetriNetUnfolder]: For 101093/101157 co-relation queries the response was YES. [2023-08-29 17:35:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30877 conditions, 3058 events. 1285/3058 cut-off events. For 101093/101157 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23059 event pairs, 197 based on Foata normal form. 2/3059 useless extension candidates. Maximal degree in co-relation 30703. Up to 2183 conditions per place. [2023-08-29 17:35:49,297 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 535 selfloop transitions, 347 changer transitions 22/914 dead transitions. [2023-08-29 17:35:49,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 914 transitions, 21999 flow [2023-08-29 17:35:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 17:35:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 17:35:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 626 transitions. [2023-08-29 17:35:49,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713855421686747 [2023-08-29 17:35:49,298 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 626 transitions. [2023-08-29 17:35:49,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 626 transitions. [2023-08-29 17:35:49,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:35:49,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 626 transitions. [2023-08-29 17:35:49,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.25) internal successors, (626), 8 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:49,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:49,300 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:49,300 INFO L175 Difference]: Start difference. First operand has 329 places, 859 transitions, 19464 flow. Second operand 8 states and 626 transitions. [2023-08-29 17:35:49,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 914 transitions, 21999 flow [2023-08-29 17:35:49,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 914 transitions, 21595 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-08-29 17:35:49,827 INFO L231 Difference]: Finished difference. Result has 331 places, 861 transitions, 19872 flow [2023-08-29 17:35:49,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19072, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=345, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19872, PETRI_PLACES=331, PETRI_TRANSITIONS=861} [2023-08-29 17:35:49,829 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 292 predicate places. [2023-08-29 17:35:49,829 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 861 transitions, 19872 flow [2023-08-29 17:35:49,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:49,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:35:49,829 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:35:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 17:35:49,830 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:35:49,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:35:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1414769900, now seen corresponding path program 7 times [2023-08-29 17:35:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:35:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856299066] [2023-08-29 17:35:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:35:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:35:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:35:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:35:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856299066] [2023-08-29 17:35:50,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856299066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:35:50,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:35:50,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:35:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700930168] [2023-08-29 17:35:50,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:35:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:35:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:35:50,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:35:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:35:50,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 17:35:50,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 861 transitions, 19872 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:50,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:35:50,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 17:35:50,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:35:52,026 INFO L130 PetriNetUnfolder]: 1282/3053 cut-off events. [2023-08-29 17:35:52,026 INFO L131 PetriNetUnfolder]: For 101660/101749 co-relation queries the response was YES. [2023-08-29 17:35:52,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31061 conditions, 3053 events. 1282/3053 cut-off events. For 101660/101749 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23034 event pairs, 197 based on Foata normal form. 3/3055 useless extension candidates. Maximal degree in co-relation 30889. Up to 2175 conditions per place. [2023-08-29 17:35:52,068 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 533 selfloop transitions, 353 changer transitions 21/917 dead transitions. [2023-08-29 17:35:52,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 917 transitions, 22443 flow [2023-08-29 17:35:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 17:35:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 17:35:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 694 transitions. [2023-08-29 17:35:52,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464524765729585 [2023-08-29 17:35:52,070 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 694 transitions. [2023-08-29 17:35:52,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 694 transitions. [2023-08-29 17:35:52,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:35:52,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 694 transitions. [2023-08-29 17:35:52,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.11111111111111) internal successors, (694), 9 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:52,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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) [2023-08-29 17:35:52,072 INFO L81 ComplementDD]: Finished complementDD. Result 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) [2023-08-29 17:35:52,072 INFO L175 Difference]: Start difference. First operand has 331 places, 861 transitions, 19872 flow. Second operand 9 states and 694 transitions. [2023-08-29 17:35:52,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 917 transitions, 22443 flow [2023-08-29 17:35:52,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 917 transitions, 21850 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-29 17:35:52,721 INFO L231 Difference]: Finished difference. Result has 338 places, 865 transitions, 20205 flow [2023-08-29 17:35:52,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19281, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=350, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20205, PETRI_PLACES=338, PETRI_TRANSITIONS=865} [2023-08-29 17:35:52,722 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 299 predicate places. [2023-08-29 17:35:52,722 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 865 transitions, 20205 flow [2023-08-29 17:35:52,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:52,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:35:52,722 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:35:52,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 17:35:52,723 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:35:52,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:35:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -536452000, now seen corresponding path program 4 times [2023-08-29 17:35:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:35:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822995792] [2023-08-29 17:35:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:35:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:35:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:35:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:35:53,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822995792] [2023-08-29 17:35:53,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822995792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:35:53,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 17:35:53,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 17:35:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123804589] [2023-08-29 17:35:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:35:53,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:35:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:35:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:35:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-29 17:35:54,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 17:35:54,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 865 transitions, 20205 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:54,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:35:54,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 17:35:54,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:35:55,624 INFO L130 PetriNetUnfolder]: 1167/2851 cut-off events. [2023-08-29 17:35:55,625 INFO L131 PetriNetUnfolder]: For 102187/102384 co-relation queries the response was YES. [2023-08-29 17:35:55,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29831 conditions, 2851 events. 1167/2851 cut-off events. For 102187/102384 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22127 event pairs, 49 based on Foata normal form. 56/2905 useless extension candidates. Maximal degree in co-relation 29656. Up to 1213 conditions per place. [2023-08-29 17:35:55,660 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 658 selfloop transitions, 280 changer transitions 22/1061 dead transitions. [2023-08-29 17:35:55,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1061 transitions, 25885 flow [2023-08-29 17:35:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 17:35:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 17:35:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2023-08-29 17:35:55,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49732262382864795 [2023-08-29 17:35:55,662 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2023-08-29 17:35:55,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2023-08-29 17:35:55,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:35:55,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2023-08-29 17:35:55,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.55555555555556) internal successors, (743), 9 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:55,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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) [2023-08-29 17:35:55,664 INFO L81 ComplementDD]: Finished complementDD. Result 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) [2023-08-29 17:35:55,664 INFO L175 Difference]: Start difference. First operand has 338 places, 865 transitions, 20205 flow. Second operand 9 states and 743 transitions. [2023-08-29 17:35:55,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1061 transitions, 25885 flow [2023-08-29 17:35:56,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1061 transitions, 25837 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-29 17:35:56,146 INFO L231 Difference]: Finished difference. Result has 351 places, 893 transitions, 21889 flow [2023-08-29 17:35:56,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=20167, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21889, PETRI_PLACES=351, PETRI_TRANSITIONS=893} [2023-08-29 17:35:56,147 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 312 predicate places. [2023-08-29 17:35:56,147 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 893 transitions, 21889 flow [2023-08-29 17:35:56,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:35:56,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:35:56,148 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:35:56,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 17:35:56,148 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:35:56,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:35:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 222619341, now seen corresponding path program 2 times [2023-08-29 17:35:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:35:56,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084715058] [2023-08-29 17:35:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:35:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:35:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:35:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:35:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:35:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084715058] [2023-08-29 17:35:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084715058] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:35:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465159621] [2023-08-29 17:35:59,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 17:35:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:35:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:35:59,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 17:35:59,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 17:35:59,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 17:35:59,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 17:35:59,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-29 17:35:59,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:35:59,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 17:35:59,325 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 17:35:59,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2023-08-29 17:35:59,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 17:35:59,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 17:35:59,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 17:35:59,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-29 17:35:59,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:35:59,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 17:35:59,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2023-08-29 17:35:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:35:59,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 17:35:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465159621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 17:35:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 17:35:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2023-08-29 17:35:59,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235997008] [2023-08-29 17:35:59,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:35:59,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 17:35:59,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:35:59,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 17:35:59,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2023-08-29 17:36:00,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 166 [2023-08-29 17:36:00,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 893 transitions, 21889 flow. Second operand has 9 states, 9 states have (on average 66.11111111111111) internal successors, (595), 9 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:36:00,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:36:00,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 166 [2023-08-29 17:36:00,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:36:01,752 INFO L130 PetriNetUnfolder]: 1358/3227 cut-off events. [2023-08-29 17:36:01,752 INFO L131 PetriNetUnfolder]: For 119392/119553 co-relation queries the response was YES. [2023-08-29 17:36:01,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34757 conditions, 3227 events. 1358/3227 cut-off events. For 119392/119553 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 24616 event pairs, 203 based on Foata normal form. 24/3251 useless extension candidates. Maximal degree in co-relation 34576. Up to 1797 conditions per place. [2023-08-29 17:36:01,789 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 896 selfloop transitions, 114 changer transitions 64/1084 dead transitions. [2023-08-29 17:36:01,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1084 transitions, 27744 flow [2023-08-29 17:36:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 17:36:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 17:36:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 788 transitions. [2023-08-29 17:36:01,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746987951807229 [2023-08-29 17:36:01,791 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 788 transitions. [2023-08-29 17:36:01,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 788 transitions. [2023-08-29 17:36:01,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 17:36:01,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 788 transitions. [2023-08-29 17:36:01,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.8) internal successors, (788), 10 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:36:01,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:36:01,794 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:36:01,794 INFO L175 Difference]: Start difference. First operand has 351 places, 893 transitions, 21889 flow. Second operand 10 states and 788 transitions. [2023-08-29 17:36:01,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1084 transitions, 27744 flow [2023-08-29 17:36:02,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1084 transitions, 27687 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-29 17:36:02,306 INFO L231 Difference]: Finished difference. Result has 363 places, 931 transitions, 23029 flow [2023-08-29 17:36:02,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=21836, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23029, PETRI_PLACES=363, PETRI_TRANSITIONS=931} [2023-08-29 17:36:02,307 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 324 predicate places. [2023-08-29 17:36:02,307 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 931 transitions, 23029 flow [2023-08-29 17:36:02,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.11111111111111) internal successors, (595), 9 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:36:02,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 17:36:02,307 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 17:36:02,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 17:36:02,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 17:36:02,513 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 17:36:02,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 17:36:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1476552406, now seen corresponding path program 5 times [2023-08-29 17:36:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 17:36:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074485655] [2023-08-29 17:36:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 17:36:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 17:36:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 17:36:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 17:36:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 17:36:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074485655] [2023-08-29 17:36:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074485655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 17:36:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102580700] [2023-08-29 17:36:07,292 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 17:36:07,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 17:36:07,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 17:36:07,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 17:36:07,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 17:36:07,432 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 17:36:07,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 17:36:07,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-29 17:36:07,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 17:36:07,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 17:36:07,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 17:36:07,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 17:36:07,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 17:36:07,899 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 17:36:07,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2023-08-29 17:36:07,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:07,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:07,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-08-29 17:36:08,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-29 17:36:08,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2023-08-29 17:36:08,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2023-08-29 17:36:08,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 89 [2023-08-29 17:36:08,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 17:36:08,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 17:36:08,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 123 [2023-08-29 17:36:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 17:36:18,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 17:37:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 17:37:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102580700] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 17:37:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 17:37:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19, 19] total 48 [2023-08-29 17:37:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25767282] [2023-08-29 17:37:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 17:37:05,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 17:37:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 17:37:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 17:37:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2116, Unknown=9, NotChecked=0, Total=2352 [2023-08-29 17:37:07,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:09,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:11,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:14,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:16,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:18,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:20,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:22,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:24,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:26,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:28,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:30,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:32,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:34,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:37,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:39,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:41,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:43,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:45,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:47,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:49,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:51,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:53,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:55,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:57,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:37:59,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:01,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:03,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:05,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:07,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:09,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:12,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:14,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:16,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:16,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 166 [2023-08-29 17:38:16,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 931 transitions, 23029 flow. Second operand has 13 states, 13 states have (on average 56.53846153846154) internal successors, (735), 13 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 17:38:16,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 17:38:16,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 166 [2023-08-29 17:38:16,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 17:38:23,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:26,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:31,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:34,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:37,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:39,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:41,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:43,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:45,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:47,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:49,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:51,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:55,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:57,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:38:59,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:01,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:05,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:07,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:09,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:11,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:13,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:16,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:18,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:20,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:23,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:32,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:34,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:36,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:38,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:40,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:42,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:44,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:46,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:49,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:51,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:53,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:56,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:39:58,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:00,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:02,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:04,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:06,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:08,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:10,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:12,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:14,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:24,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:26,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:28,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:30,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:32,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:34,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:36,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:38,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:40,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:44,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:46,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:48,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:50,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:40:52,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:01,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:03,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:06,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:08,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:10,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:22,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:25,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:27,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:29,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:31,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:33,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:35,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:37,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:39,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:41,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:43,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:45,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:47,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:49,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:41:51,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:00,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:02,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:05,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:07,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:11,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:13,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:15,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:17,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:19,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:21,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:23,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:25,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:27,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:29,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:31,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:32,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:34,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:36,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:38,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:40,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:52,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:56,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:42:58,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:00,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:02,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:04,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:07,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:09,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:11,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:13,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:25,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:27,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:29,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:32,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:36,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:38,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:39,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:41,614 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse24 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse34 (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|)) (.cse12 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse34 .cse12 0))) (.cse10 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store .cse34 .cse24 0) .cse12 0)))) (let ((.cse11 (select .cse10 |c_~#a~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse19 (select |c_#race| |c_~#a~0.base|)) (.cse20 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse1 |c_~#a~0.offset| 1) 0) (+ .cse1 2 |c_~#a~0.offset|) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse2 |c_~#a~0.base| (store (store (select .cse2 |c_~#a~0.base|) (+ .cse1 3 |c_~#a~0.offset|) 0) (+ .cse1 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse7 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse8 (let ((.cse9 (store .cse10 |c_~#a~0.base| (store (store .cse11 (+ .cse7 |c_~#a~0.offset| 1) 0) (+ .cse7 2 |c_~#a~0.offset|) 0)))) (store .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse8 |c_~#a~0.base| (store (store (select .cse8 |c_~#a~0.base|) (+ .cse7 3 |c_~#a~0.offset|) 0) (+ .cse7 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse13 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse13 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse13 |c_~#a~0.offset| 1) 0) (+ .cse13 2 |c_~#a~0.offset|) 0)))) (store .cse15 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse14 |c_~#a~0.base| (store (store (select .cse14 |c_~#a~0.base|) (+ .cse13 3 |c_~#a~0.offset|) 0) (+ .cse13 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse16 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse16 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse17 (let ((.cse18 (store .cse10 |c_~#a~0.base| (store (store .cse11 (+ .cse16 |c_~#a~0.offset| 1) 0) (+ .cse16 2 |c_~#a~0.offset|) 0)))) (store .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse17 |c_~#a~0.base| (store (store (select .cse17 |c_~#a~0.base|) (+ .cse16 3 |c_~#a~0.offset|) 0) (+ .cse16 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse20 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse21 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse21 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse21 |c_~#a~0.offset| 1) 0) (+ .cse21 2 |c_~#a~0.offset|) 0)))) (store .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse22 |c_~#a~0.base| (store (store (select .cse22 |c_~#a~0.base|) (+ .cse21 3 |c_~#a~0.offset|) 0) (+ .cse21 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse20 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse24) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse26 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse25 (let ((.cse27 (store .cse10 |c_~#a~0.base| (store (store .cse11 (+ .cse26 |c_~#a~0.offset| 1) 0) (+ .cse26 2 |c_~#a~0.offset|) 0)))) (store .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse25 |c_~#a~0.base| (store (store (select .cse25 |c_~#a~0.base|) (+ .cse26 3 |c_~#a~0.offset|) 0) (+ .cse26 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse24) 0)) (not (= (select .cse0 (+ .cse26 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse29 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse28 (let ((.cse30 (store .cse10 |c_~#a~0.base| (store (store .cse11 (+ .cse29 |c_~#a~0.offset| 1) 0) (+ .cse29 2 |c_~#a~0.offset|) 0)))) (store .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse28 |c_~#a~0.base| (store (store (select .cse28 |c_~#a~0.base|) (+ .cse29 3 |c_~#a~0.offset|) 0) (+ .cse29 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) (not (= (select .cse0 (+ .cse29 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse32 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse31 (let ((.cse33 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse32 |c_~#a~0.offset| 1) 0) (+ .cse32 2 |c_~#a~0.offset|) 0)))) (store .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse31 |c_~#a~0.base| (store (store (select .cse31 |c_~#a~0.base|) (+ .cse32 3 |c_~#a~0.offset|) 0) (+ .cse32 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse24) 0)) (not (= (select .cse0 (+ .cse32 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse20 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse20 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) is different from true [2023-08-29 17:43:42,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:44,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:46,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:48,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:50,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:52,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:54,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:56,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:43:58,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:00,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:04,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:22,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:24,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:26,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:28,361 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|)) (.cse18 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse14 .cse18 0)))) (let ((.cse10 (select |c_#race| |c_~#a~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.cse22 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse1 |c_~#a~0.offset| 1) 0) (+ .cse1 2 |c_~#a~0.offset|) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse2 |c_~#a~0.base| (store (store (select .cse2 |c_~#a~0.base|) (+ .cse1 3 |c_~#a~0.offset|) 0) (+ .cse1 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse7 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse7 |c_~#a~0.offset| 1) 0) (+ .cse7 2 |c_~#a~0.offset|) 0)))) (store .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse8 |c_~#a~0.base| (store (store (select .cse8 |c_~#a~0.base|) (+ .cse7 3 |c_~#a~0.offset|) 0) (+ .cse7 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse11 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse11 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse11 |c_~#a~0.offset| 1) 0) (+ .cse11 2 |c_~#a~0.offset|) 0)))) (store .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse12 |c_~#a~0.base| (store (store (select .cse12 |c_~#a~0.base|) (+ .cse11 3 |c_~#a~0.offset|) 0) (+ .cse11 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (= (select .cse14 .cse4) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse15 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse15 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse16 (let ((.cse17 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse15 |c_~#a~0.offset| 1) 0) (+ .cse15 2 |c_~#a~0.offset|) 0)))) (store .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse16 |c_~#a~0.base| (store (store (select .cse16 |c_~#a~0.base|) (+ .cse15 3 |c_~#a~0.offset|) 0) (+ .cse15 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))) (= 0 (select .cse14 |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse19 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse19 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse20 (let ((.cse21 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse19 |c_~#a~0.offset| 1) 0) (+ .cse19 2 |c_~#a~0.offset|) 0)))) (store .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse20 |c_~#a~0.base| (store (store (select .cse20 |c_~#a~0.base|) (+ .cse19 3 |c_~#a~0.offset|) 0) (+ .cse19 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse23 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse23 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse23 |c_~#a~0.offset| 1) 0) (+ .cse23 2 |c_~#a~0.offset|) 0)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse24 |c_~#a~0.base| (store (store (select .cse24 |c_~#a~0.base|) (+ .cse23 3 |c_~#a~0.offset|) 0) (+ .cse23 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))) (= (select .cse14 .cse18) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse26 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse26 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse26 |c_~#a~0.offset| 1) 0) (+ .cse26 2 |c_~#a~0.offset|) 0)))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse27 |c_~#a~0.base| (store (store (select .cse27 |c_~#a~0.base|) (+ .cse26 3 |c_~#a~0.offset|) 0) (+ .cse26 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (= (select .cse14 .cse22) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse29 (let ((.cse31 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse30 |c_~#a~0.offset| 1) 0) (+ .cse30 2 |c_~#a~0.offset|) 0)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse29 |c_~#a~0.base| (store (store (select .cse29 |c_~#a~0.base|) (+ .cse30 3 |c_~#a~0.offset|) 0) (+ .cse30 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (not (= (select .cse0 (+ .cse30 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-29 17:44:32,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:35,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:37,068 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.cse22 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse10 (select |c_#race| |c_~#a~0.base|)) (.cse18 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse1 |c_~#a~0.offset| 1) 0) (+ .cse1 2 |c_~#a~0.offset|) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse2 |c_~#a~0.base| (store (store (select .cse2 |c_~#a~0.base|) (+ .cse1 3 |c_~#a~0.offset|) 0) (+ .cse1 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse7 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse7 |c_~#a~0.offset| 1) 0) (+ .cse7 2 |c_~#a~0.offset|) 0)))) (store .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse8 |c_~#a~0.base| (store (store (select .cse8 |c_~#a~0.base|) (+ .cse7 3 |c_~#a~0.offset|) 0) (+ .cse7 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse11 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse11 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse11 |c_~#a~0.offset| 1) 0) (+ .cse11 2 |c_~#a~0.offset|) 0)))) (store .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse12 |c_~#a~0.base| (store (store (select .cse12 |c_~#a~0.base|) (+ .cse11 3 |c_~#a~0.offset|) 0) (+ .cse11 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse14 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse14 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse14 |c_~#a~0.offset| 1) 0) (+ .cse14 2 |c_~#a~0.offset|) 0)))) (store .cse16 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse15 |c_~#a~0.base| (store (store (select .cse15 |c_~#a~0.base|) (+ .cse14 3 |c_~#a~0.offset|) 0) (+ .cse14 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse19 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse19 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse20 (let ((.cse21 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse19 |c_~#a~0.offset| 1) 0) (+ .cse19 2 |c_~#a~0.offset|) 0)))) (store .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse20 |c_~#a~0.base| (store (store (select .cse20 |c_~#a~0.base|) (+ .cse19 3 |c_~#a~0.offset|) 0) (+ .cse19 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse23 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse23 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse23 |c_~#a~0.offset| 1) 0) (+ .cse23 2 |c_~#a~0.offset|) 0)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse24 |c_~#a~0.base| (store (store (select .cse24 |c_~#a~0.base|) (+ .cse23 3 |c_~#a~0.offset|) 0) (+ .cse23 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse26 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse26 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse26 |c_~#a~0.offset| 1) 0) (+ .cse26 2 |c_~#a~0.offset|) 0)))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse27 |c_~#a~0.base| (store (store (select .cse27 |c_~#a~0.base|) (+ .cse26 3 |c_~#a~0.offset|) 0) (+ .cse26 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse29 (let ((.cse31 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse30 |c_~#a~0.offset| 1) 0) (+ .cse30 2 |c_~#a~0.offset|) 0)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse29 |c_~#a~0.base| (store (store (select .cse29 |c_~#a~0.base|) (+ .cse30 3 |c_~#a~0.offset|) 0) (+ .cse30 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (not (= (select .cse0 (+ .cse30 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) is different from true [2023-08-29 17:44:39,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:41,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:43,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:45,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:47,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:49,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:51,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:54,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:56,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:44:58,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:00,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:02,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:04,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:06,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:08,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:10,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:12,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:14,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:16,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:18,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:20,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:22,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:24,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:29,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:31,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:33,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:35,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:37,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:47,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:49,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:51,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:55,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:57,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:45:59,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:01,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:03,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:05,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:07,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:09,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:11,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:13,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:15,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:17,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:19,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:21,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:23,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:25,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 17:46:27,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15