./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c 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 /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/condvar.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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 15:53:50,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 15:53:50,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 15:53:50,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 15:53:50,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 15:53:50,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 15:53:50,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 15:53:50,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 15:53:50,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 15:53:50,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 15:53:50,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 15:53:50,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 15:53:50,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 15:53:50,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 15:53:50,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 15:53:50,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 15:53:50,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 15:53:50,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 15:53:50,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 15:53:50,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 15:53:50,937 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 15:53:50,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 15:53:50,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 15:53:50,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 15:53:50,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 15:53:50,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 15:53:50,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 15:53:50,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 15:53:50,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 15:53:50,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 15:53:50,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 15:53:50,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 15:53:50,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 15:53:50,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 15:53:50,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 15:53:50,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 15:53:50,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 15:53:50,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 15:53:50,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 15:53:50,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 15:53:50,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 15:53:50,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 15:53:50,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 15:53:50,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 15:53:50,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 15:53:50,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 15:53:50,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 15:53:50,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 15:53:50,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 15:53:50,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 15:53:50,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 15:53:50,993 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 15:53:50,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 15:53:50,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 15:53:50,995 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 15:53:50,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 15:53:50,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 15:53:50,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 15:53:50,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 15:53:50,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 15:53:50,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 15:53:50,996 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 15:53:50,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 15:53:50,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 15:53:50,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 15:53:50,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 15:53:50,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 15:53:50,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 15:53:50,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 15:53:50,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:53:50,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 15:53:50,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 15:53:50,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 15:53:50,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 15:53:50,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 15:53:50,999 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 15:53:50,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 15:53:51,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 15:53:51,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2022-04-18 15:53:51,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 15:53:51,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 15:53:51,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 15:53:51,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 15:53:51,294 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 15:53:51,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/condvar.i [2022-04-18 15:53:51,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff908d6/ca47ae07056446b3a05c1bfd35b05f3e/FLAGbec388754 [2022-04-18 15:53:51,818 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 15:53:51,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/condvar.i [2022-04-18 15:53:51,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff908d6/ca47ae07056446b3a05c1bfd35b05f3e/FLAGbec388754 [2022-04-18 15:53:51,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff908d6/ca47ae07056446b3a05c1bfd35b05f3e [2022-04-18 15:53:51,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 15:53:51,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 15:53:51,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 15:53:51,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 15:53:51,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 15:53:51,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:53:51" (1/1) ... [2022-04-18 15:53:51,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abac6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:51, skipping insertion in model container [2022-04-18 15:53:51,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:53:51" (1/1) ... [2022-04-18 15:53:51,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 15:53:51,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 15:53:52,016 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 15:53:52,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/condvar.i[30458,30471] [2022-04-18 15:53:52,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:53:52,201 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 15:53:52,213 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 15:53:52,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/condvar.i[30458,30471] [2022-04-18 15:53:52,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 15:53:52,264 INFO L208 MainTranslator]: Completed translation [2022-04-18 15:53:52,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52 WrapperNode [2022-04-18 15:53:52,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 15:53:52,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 15:53:52,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 15:53:52,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 15:53:52,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,321 INFO L137 Inliner]: procedures = 169, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2022-04-18 15:53:52,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 15:53:52,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 15:53:52,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 15:53:52,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 15:53:52,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 15:53:52,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 15:53:52,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 15:53:52,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 15:53:52,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (1/1) ... [2022-04-18 15:53:52,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 15:53:52,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:53:52,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 15:53:52,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 15:53:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 15:53:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 15:53:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-04-18 15:53:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 15:53:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 15:53:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 15:53:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 15:53:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-04-18 15:53:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-04-18 15:53:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 15:53:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 15:53:52,437 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 15:53:52,532 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 15:53:52,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 15:53:52,775 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 15:53:52,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 15:53:52,782 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-18 15:53:52,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:53:52 BoogieIcfgContainer [2022-04-18 15:53:52,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 15:53:52,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 15:53:52,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 15:53:52,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 15:53:52,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:53:51" (1/3) ... [2022-04-18 15:53:52,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30409da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:53:52, skipping insertion in model container [2022-04-18 15:53:52,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:53:52" (2/3) ... [2022-04-18 15:53:52,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30409da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:53:52, skipping insertion in model container [2022-04-18 15:53:52,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:53:52" (3/3) ... [2022-04-18 15:53:52,792 INFO L111 eAbstractionObserver]: Analyzing ICFG condvar.i [2022-04-18 15:53:52,797 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 15:53:52,797 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 15:53:52,797 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-04-18 15:53:52,798 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 15:53:52,857 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-04-18 15:53:52,923 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 15:53:52,930 INFO L340 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 [2022-04-18 15:53:52,930 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-04-18 15:53:52,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 99 transitions, 206 flow [2022-04-18 15:53:53,004 INFO L129 PetriNetUnfolder]: 5/98 cut-off events. [2022-04-18 15:53:53,004 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 15:53:53,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 98 events. 5/98 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2022-04-18 15:53:53,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 99 transitions, 206 flow [2022-04-18 15:53:53,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 91 transitions, 185 flow [2022-04-18 15:53:53,030 INFO L129 PetriNetUnfolder]: 1/53 cut-off events. [2022-04-18 15:53:53,031 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 15:53:53,031 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:53,032 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:53,032 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1555367986, now seen corresponding path program 1 times [2022-04-18 15:53:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:53,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869416196] [2022-04-18 15:53:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:53,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869416196] [2022-04-18 15:53:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869416196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:53:53,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:53:53,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:53:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587267694] [2022-04-18 15:53:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:53:53,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:53:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:53:53,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:53:53,349 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 99 [2022-04-18 15:53:53,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:53,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 99 [2022-04-18 15:53:53,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:53,431 INFO L129 PetriNetUnfolder]: 17/173 cut-off events. [2022-04-18 15:53:53,433 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 15:53:53,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 173 events. 17/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 586 event pairs, 2 based on Foata normal form. 10/156 useless extension candidates. Maximal degree in co-relation 167. Up to 22 conditions per place. [2022-04-18 15:53:53,437 INFO L132 encePairwiseOnDemand]: 92/99 looper letters, 9 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2022-04-18 15:53:53,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 93 transitions, 213 flow [2022-04-18 15:53:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:53:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:53:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-04-18 15:53:53,454 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9528619528619529 [2022-04-18 15:53:53,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2022-04-18 15:53:53,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2022-04-18 15:53:53,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:53,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2022-04-18 15:53:53,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,475 INFO L186 Difference]: Start difference. First operand has 90 places, 91 transitions, 185 flow. Second operand 3 states and 283 transitions. [2022-04-18 15:53:53,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 93 transitions, 213 flow [2022-04-18 15:53:53,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 15:53:53,485 INFO L242 Difference]: Finished difference. Result has 93 places, 91 transitions, 204 flow [2022-04-18 15:53:53,487 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-04-18 15:53:53,490 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 3 predicate places. [2022-04-18 15:53:53,491 INFO L478 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 204 flow [2022-04-18 15:53:53,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,491 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:53,491 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:53,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 15:53:53,492 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1860223654, now seen corresponding path program 1 times [2022-04-18 15:53:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:53,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283674739] [2022-04-18 15:53:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:53,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:53,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283674739] [2022-04-18 15:53:53,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283674739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:53:53,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:53:53,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:53:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677321396] [2022-04-18 15:53:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:53:53,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:53:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:53:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:53:53,564 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 99 [2022-04-18 15:53:53,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:53,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 99 [2022-04-18 15:53:53,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:53,602 INFO L129 PetriNetUnfolder]: 17/211 cut-off events. [2022-04-18 15:53:53,603 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 15:53:53,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 211 events. 17/211 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 733 event pairs, 2 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 225. Up to 19 conditions per place. [2022-04-18 15:53:53,604 INFO L132 encePairwiseOnDemand]: 95/99 looper letters, 8 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2022-04-18 15:53:53,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 95 transitions, 234 flow [2022-04-18 15:53:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:53:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:53:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2022-04-18 15:53:53,606 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2022-04-18 15:53:53,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2022-04-18 15:53:53,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2022-04-18 15:53:53,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:53,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2022-04-18 15:53:53,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,610 INFO L186 Difference]: Start difference. First operand has 93 places, 91 transitions, 204 flow. Second operand 3 states and 276 transitions. [2022-04-18 15:53:53,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 95 transitions, 234 flow [2022-04-18 15:53:53,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:53:53,613 INFO L242 Difference]: Finished difference. Result has 95 places, 93 transitions, 220 flow [2022-04-18 15:53:53,613 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2022-04-18 15:53:53,614 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2022-04-18 15:53:53,614 INFO L478 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 220 flow [2022-04-18 15:53:53,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,615 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:53,615 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:53,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 15:53:53,640 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash -794843301, now seen corresponding path program 1 times [2022-04-18 15:53:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:53,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019878212] [2022-04-18 15:53:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019878212] [2022-04-18 15:53:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019878212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:53:53,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:53:53,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 15:53:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299921686] [2022-04-18 15:53:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:53:53,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:53:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:53:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:53:53,728 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99 [2022-04-18 15:53:53,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:53,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99 [2022-04-18 15:53:53,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:53,807 INFO L129 PetriNetUnfolder]: 23/256 cut-off events. [2022-04-18 15:53:53,807 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-04-18 15:53:53,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 256 events. 23/256 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1046 event pairs, 5 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 320. Up to 36 conditions per place. [2022-04-18 15:53:53,811 INFO L132 encePairwiseOnDemand]: 94/99 looper letters, 13 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2022-04-18 15:53:53,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 99 transitions, 280 flow [2022-04-18 15:53:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:53:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:53:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2022-04-18 15:53:53,814 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2022-04-18 15:53:53,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2022-04-18 15:53:53,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2022-04-18 15:53:53,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:53,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2022-04-18 15:53:53,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,818 INFO L186 Difference]: Start difference. First operand has 95 places, 93 transitions, 220 flow. Second operand 3 states and 271 transitions. [2022-04-18 15:53:53,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 99 transitions, 280 flow [2022-04-18 15:53:53,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:53:53,823 INFO L242 Difference]: Finished difference. Result has 97 places, 96 transitions, 250 flow [2022-04-18 15:53:53,823 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2022-04-18 15:53:53,825 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2022-04-18 15:53:53,825 INFO L478 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 250 flow [2022-04-18 15:53:53,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,825 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:53,826 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:53,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 15:53:53,826 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash -794083085, now seen corresponding path program 1 times [2022-04-18 15:53:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:53,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491184441] [2022-04-18 15:53:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:53,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:53,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491184441] [2022-04-18 15:53:53,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491184441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:53:53,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:53:53,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 15:53:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194887349] [2022-04-18 15:53:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:53:53,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:53:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:53:53,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:53:53,879 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2022-04-18 15:53:53,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:53,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2022-04-18 15:53:53,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:53,924 INFO L129 PetriNetUnfolder]: 15/258 cut-off events. [2022-04-18 15:53:53,924 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-04-18 15:53:53,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 258 events. 15/258 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1193 event pairs, 3 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 346. Up to 21 conditions per place. [2022-04-18 15:53:53,926 INFO L132 encePairwiseOnDemand]: 96/99 looper letters, 10 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2022-04-18 15:53:53,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 282 flow [2022-04-18 15:53:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:53:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:53:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-04-18 15:53:53,928 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2022-04-18 15:53:53,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2022-04-18 15:53:53,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2022-04-18 15:53:53,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:53,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2022-04-18 15:53:53,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,934 INFO L186 Difference]: Start difference. First operand has 97 places, 96 transitions, 250 flow. Second operand 3 states and 274 transitions. [2022-04-18 15:53:53,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 282 flow [2022-04-18 15:53:53,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:53:53,938 INFO L242 Difference]: Finished difference. Result has 98 places, 97 transitions, 252 flow [2022-04-18 15:53:53,938 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2022-04-18 15:53:53,940 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2022-04-18 15:53:53,944 INFO L478 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 252 flow [2022-04-18 15:53:53,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:53,944 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:53,945 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:53,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 15:53:53,946 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 497494651, now seen corresponding path program 1 times [2022-04-18 15:53:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:53,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880625635] [2022-04-18 15:53:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:54,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880625635] [2022-04-18 15:53:54,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880625635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:53:54,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 15:53:54,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 15:53:54,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045075404] [2022-04-18 15:53:54,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:53:54,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:53:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:54,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:53:54,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 15:53:54,013 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 99 [2022-04-18 15:53:54,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:54,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 99 [2022-04-18 15:53:54,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:54,042 INFO L129 PetriNetUnfolder]: 6/148 cut-off events. [2022-04-18 15:53:54,042 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-04-18 15:53:54,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 148 events. 6/148 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 357 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2022-04-18 15:53:54,043 INFO L132 encePairwiseOnDemand]: 96/99 looper letters, 4 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2022-04-18 15:53:54,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 234 flow [2022-04-18 15:53:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:53:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:53:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-04-18 15:53:54,045 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-04-18 15:53:54,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2022-04-18 15:53:54,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2022-04-18 15:53:54,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:54,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2022-04-18 15:53:54,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,048 INFO L186 Difference]: Start difference. First operand has 98 places, 97 transitions, 252 flow. Second operand 3 states and 277 transitions. [2022-04-18 15:53:54,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 234 flow [2022-04-18 15:53:54,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 218 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-04-18 15:53:54,067 INFO L242 Difference]: Finished difference. Result has 94 places, 90 transitions, 212 flow [2022-04-18 15:53:54,068 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2022-04-18 15:53:54,070 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2022-04-18 15:53:54,071 INFO L478 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 212 flow [2022-04-18 15:53:54,071 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,071 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:54,072 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:54,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 15:53:54,072 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 832672352, now seen corresponding path program 1 times [2022-04-18 15:53:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:54,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493351441] [2022-04-18 15:53:54,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:54,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493351441] [2022-04-18 15:53:54,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493351441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:53:54,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949176384] [2022-04-18 15:53:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:53:54,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 15:53:54,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 15:53:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:54,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 15:53:54,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:53:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 15:53:54,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 15:53:54,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949176384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 15:53:54,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 15:53:54,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-04-18 15:53:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292369765] [2022-04-18 15:53:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 15:53:54,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 15:53:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:54,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 15:53:54,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-18 15:53:54,343 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99 [2022-04-18 15:53:54,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:54,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99 [2022-04-18 15:53:54,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:54,375 INFO L129 PetriNetUnfolder]: 25/231 cut-off events. [2022-04-18 15:53:54,375 INFO L130 PetriNetUnfolder]: For 20/24 co-relation queries the response was YES. [2022-04-18 15:53:54,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 231 events. 25/231 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 953 event pairs, 5 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 286. Up to 40 conditions per place. [2022-04-18 15:53:54,377 INFO L132 encePairwiseOnDemand]: 94/99 looper letters, 14 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2022-04-18 15:53:54,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 276 flow [2022-04-18 15:53:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 15:53:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 15:53:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2022-04-18 15:53:54,378 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2022-04-18 15:53:54,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2022-04-18 15:53:54,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2022-04-18 15:53:54,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:54,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2022-04-18 15:53:54,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,381 INFO L186 Difference]: Start difference. First operand has 94 places, 90 transitions, 212 flow. Second operand 3 states and 271 transitions. [2022-04-18 15:53:54,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 276 flow [2022-04-18 15:53:54,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:53:54,384 INFO L242 Difference]: Finished difference. Result has 96 places, 94 transitions, 254 flow [2022-04-18 15:53:54,384 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2022-04-18 15:53:54,385 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2022-04-18 15:53:54,385 INFO L478 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 254 flow [2022-04-18 15:53:54,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:54,386 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:54,386 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:54,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-18 15:53:54,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-18 15:53:54,608 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:54,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1500992215, now seen corresponding path program 1 times [2022-04-18 15:53:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:54,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397503253] [2022-04-18 15:53:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:54,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:54,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:54,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397503253] [2022-04-18 15:53:54,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397503253] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:53:54,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043857077] [2022-04-18 15:53:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:54,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:54,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:53:54,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 15:53:54,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 15:53:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:54,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 15:53:54,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:53:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:54,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:53:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:55,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043857077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:53:55,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:53:55,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-04-18 15:53:55,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490031789] [2022-04-18 15:53:55,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:53:55,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 15:53:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 15:53:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-18 15:53:55,078 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 99 [2022-04-18 15:53:55,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 254 flow. Second operand has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:55,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:55,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 99 [2022-04-18 15:53:55,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:55,183 INFO L129 PetriNetUnfolder]: 15/195 cut-off events. [2022-04-18 15:53:55,184 INFO L130 PetriNetUnfolder]: For 37/40 co-relation queries the response was YES. [2022-04-18 15:53:55,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 195 events. 15/195 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 581 event pairs, 0 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 251. Up to 23 conditions per place. [2022-04-18 15:53:55,185 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 11 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2022-04-18 15:53:55,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 104 transitions, 316 flow [2022-04-18 15:53:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 15:53:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-04-18 15:53:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 796 transitions. [2022-04-18 15:53:55,188 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8933782267115601 [2022-04-18 15:53:55,188 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 796 transitions. [2022-04-18 15:53:55,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 796 transitions. [2022-04-18 15:53:55,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:55,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 796 transitions. [2022-04-18 15:53:55,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.44444444444444) internal successors, (796), 9 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:55,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:55,193 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:55,194 INFO L186 Difference]: Start difference. First operand has 96 places, 94 transitions, 254 flow. Second operand 9 states and 796 transitions. [2022-04-18 15:53:55,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 104 transitions, 316 flow [2022-04-18 15:53:55,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 104 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 15:53:55,197 INFO L242 Difference]: Finished difference. Result has 105 places, 100 transitions, 292 flow [2022-04-18 15:53:55,197 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2022-04-18 15:53:55,198 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2022-04-18 15:53:55,198 INFO L478 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 292 flow [2022-04-18 15:53:55,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:55,199 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:55,199 INFO L255 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:55,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 15:53:55,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-18 15:53:55,423 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1375735579, now seen corresponding path program 2 times [2022-04-18 15:53:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:55,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981484371] [2022-04-18 15:53:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:55,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:55,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981484371] [2022-04-18 15:53:55,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981484371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:53:55,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77481382] [2022-04-18 15:53:55,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 15:53:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:55,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:53:55,496 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) [2022-04-18 15:53:55,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 15:53:55,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 15:53:55,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 15:53:55,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 15:53:55,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:53:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:55,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:53:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:55,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77481382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:53:55,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:53:55,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-04-18 15:53:55,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607751119] [2022-04-18 15:53:55,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:53:55,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-18 15:53:55,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:55,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-18 15:53:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-04-18 15:53:55,953 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 99 [2022-04-18 15:53:55,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 292 flow. Second operand has 18 states, 18 states have (on average 88.27777777777777) internal successors, (1589), 18 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:55,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:55,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 99 [2022-04-18 15:53:55,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:56,152 INFO L129 PetriNetUnfolder]: 15/231 cut-off events. [2022-04-18 15:53:56,153 INFO L130 PetriNetUnfolder]: For 47/50 co-relation queries the response was YES. [2022-04-18 15:53:56,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 231 events. 15/231 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 572 event pairs, 0 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 340. Up to 23 conditions per place. [2022-04-18 15:53:56,156 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 19 selfloop transitions, 21 changer transitions 0/124 dead transitions. [2022-04-18 15:53:56,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 480 flow [2022-04-18 15:53:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-18 15:53:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-04-18 15:53:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1850 transitions. [2022-04-18 15:53:56,161 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8898508898508899 [2022-04-18 15:53:56,161 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1850 transitions. [2022-04-18 15:53:56,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1850 transitions. [2022-04-18 15:53:56,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:56,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1850 transitions. [2022-04-18 15:53:56,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 88.0952380952381) internal successors, (1850), 21 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:56,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 99.0) internal successors, (2178), 22 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:56,171 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 99.0) internal successors, (2178), 22 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:56,171 INFO L186 Difference]: Start difference. First operand has 105 places, 100 transitions, 292 flow. Second operand 21 states and 1850 transitions. [2022-04-18 15:53:56,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 480 flow [2022-04-18 15:53:56,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 466 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-04-18 15:53:56,176 INFO L242 Difference]: Finished difference. Result has 129 places, 113 transitions, 416 flow [2022-04-18 15:53:56,177 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=416, PETRI_PLACES=129, PETRI_TRANSITIONS=113} [2022-04-18 15:53:56,177 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 39 predicate places. [2022-04-18 15:53:56,177 INFO L478 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 416 flow [2022-04-18 15:53:56,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 88.27777777777777) internal successors, (1589), 18 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:56,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:56,179 INFO L255 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:56,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-18 15:53:56,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:56,404 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash 145926911, now seen corresponding path program 3 times [2022-04-18 15:53:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:56,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526738946] [2022-04-18 15:53:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:56,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:56,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526738946] [2022-04-18 15:53:56,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526738946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:53:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300123803] [2022-04-18 15:53:56,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 15:53:56,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:56,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:53:56,584 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) [2022-04-18 15:53:56,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 15:53:56,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-18 15:53:56,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 15:53:56,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-18 15:53:56,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:53:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:56,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:53:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:57,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300123803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:53:57,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:53:57,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-04-18 15:53:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947654232] [2022-04-18 15:53:57,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:53:57,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-18 15:53:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:53:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-18 15:53:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-04-18 15:53:57,269 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 99 [2022-04-18 15:53:57,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 113 transitions, 416 flow. Second operand has 34 states, 34 states have (on average 88.38235294117646) internal successors, (3005), 34 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:57,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:53:57,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 99 [2022-04-18 15:53:57,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:53:57,828 INFO L129 PetriNetUnfolder]: 15/303 cut-off events. [2022-04-18 15:53:57,829 INFO L130 PetriNetUnfolder]: For 279/282 co-relation queries the response was YES. [2022-04-18 15:53:57,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 303 events. 15/303 cut-off events. For 279/282 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 572 event pairs, 0 based on Foata normal form. 8/298 useless extension candidates. Maximal degree in co-relation 578. Up to 27 conditions per place. [2022-04-18 15:53:57,831 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 35 selfloop transitions, 45 changer transitions 0/164 dead transitions. [2022-04-18 15:53:57,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 164 transitions, 892 flow [2022-04-18 15:53:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-18 15:53:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-04-18 15:53:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3958 transitions. [2022-04-18 15:53:57,839 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8884399551066218 [2022-04-18 15:53:57,839 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3958 transitions. [2022-04-18 15:53:57,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3958 transitions. [2022-04-18 15:53:57,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:53:57,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3958 transitions. [2022-04-18 15:53:57,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 87.95555555555555) internal successors, (3958), 45 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:57,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 99.0) internal successors, (4554), 46 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:57,857 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 99.0) internal successors, (4554), 46 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:57,857 INFO L186 Difference]: Start difference. First operand has 129 places, 113 transitions, 416 flow. Second operand 45 states and 3958 transitions. [2022-04-18 15:53:57,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 164 transitions, 892 flow [2022-04-18 15:53:57,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 852 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-04-18 15:53:57,863 INFO L242 Difference]: Finished difference. Result has 176 places, 138 transitions, 694 flow [2022-04-18 15:53:57,863 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=694, PETRI_PLACES=176, PETRI_TRANSITIONS=138} [2022-04-18 15:53:57,864 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 86 predicate places. [2022-04-18 15:53:57,864 INFO L478 AbstractCegarLoop]: Abstraction has has 176 places, 138 transitions, 694 flow [2022-04-18 15:53:57,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 88.38235294117646) internal successors, (3005), 34 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:53:57,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:53:57,865 INFO L255 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:53:57,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 15:53:58,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:58,079 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:53:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:53:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1866871937, now seen corresponding path program 4 times [2022-04-18 15:53:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:53:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13189648] [2022-04-18 15:53:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:53:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:53:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:53:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:53:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13189648] [2022-04-18 15:53:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13189648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:53:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154626644] [2022-04-18 15:53:58,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 15:53:58,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:53:58,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:53:58,515 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) [2022-04-18 15:53:58,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 15:53:58,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 15:53:58,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 15:53:58,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-18 15:53:58,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:53:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:53:58,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:54:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:54:00,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154626644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:54:00,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:54:00,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-04-18 15:54:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594183581] [2022-04-18 15:54:00,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:54:00,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-18 15:54:00,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:54:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-18 15:54:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2022-04-18 15:54:00,030 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 99 [2022-04-18 15:54:00,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 138 transitions, 694 flow. Second operand has 66 states, 66 states have (on average 88.43939393939394) internal successors, (5837), 66 states have internal predecessors, (5837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:00,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:54:00,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 99 [2022-04-18 15:54:00,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:54:01,691 INFO L129 PetriNetUnfolder]: 15/447 cut-off events. [2022-04-18 15:54:01,691 INFO L130 PetriNetUnfolder]: For 2211/2214 co-relation queries the response was YES. [2022-04-18 15:54:01,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 447 events. 15/447 cut-off events. For 2211/2214 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 572 event pairs, 0 based on Foata normal form. 16/450 useless extension candidates. Maximal degree in co-relation 1127. Up to 58 conditions per place. [2022-04-18 15:54:01,696 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 67 selfloop transitions, 93 changer transitions 0/244 dead transitions. [2022-04-18 15:54:01,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 244 transitions, 1862 flow [2022-04-18 15:54:01,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-04-18 15:54:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-04-18 15:54:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 8174 transitions. [2022-04-18 15:54:01,709 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8878027587705007 [2022-04-18 15:54:01,709 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 8174 transitions. [2022-04-18 15:54:01,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 8174 transitions. [2022-04-18 15:54:01,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:54:01,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 8174 transitions. [2022-04-18 15:54:01,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 87.89247311827957) internal successors, (8174), 93 states have internal predecessors, (8174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:01,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 99.0) internal successors, (9306), 94 states have internal predecessors, (9306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:01,781 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 99.0) internal successors, (9306), 94 states have internal predecessors, (9306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:01,782 INFO L186 Difference]: Start difference. First operand has 176 places, 138 transitions, 694 flow. Second operand 93 states and 8174 transitions. [2022-04-18 15:54:01,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 244 transitions, 1862 flow [2022-04-18 15:54:01,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 244 transitions, 1774 flow, removed 26 selfloop flow, removed 18 redundant places. [2022-04-18 15:54:01,796 INFO L242 Difference]: Finished difference. Result has 267 places, 187 transitions, 1328 flow [2022-04-18 15:54:01,797 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1328, PETRI_PLACES=267, PETRI_TRANSITIONS=187} [2022-04-18 15:54:01,798 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 177 predicate places. [2022-04-18 15:54:01,799 INFO L478 AbstractCegarLoop]: Abstraction has has 267 places, 187 transitions, 1328 flow [2022-04-18 15:54:01,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 88.43939393939394) internal successors, (5837), 66 states have internal predecessors, (5837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:01,800 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:54:01,801 INFO L255 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:54:01,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-18 15:54:02,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-18 15:54:02,007 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:54:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:54:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -188576641, now seen corresponding path program 5 times [2022-04-18 15:54:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:54:02,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792339986] [2022-04-18 15:54:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:54:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:54:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 15:54:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:54:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 15:54:03,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792339986] [2022-04-18 15:54:03,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792339986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 15:54:03,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385395400] [2022-04-18 15:54:03,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-18 15:54:03,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:54:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 15:54:03,388 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) [2022-04-18 15:54:03,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 15:54:03,516 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-04-18 15:54:03,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 15:54:03,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-18 15:54:03,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 15:54:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:54:04,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 15:54:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 15:54:05,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385395400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 15:54:05,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 15:54:05,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 89 [2022-04-18 15:54:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289896185] [2022-04-18 15:54:05,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 15:54:05,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-18 15:54:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 15:54:05,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-18 15:54:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2022-04-18 15:54:05,432 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 99 [2022-04-18 15:54:05,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 187 transitions, 1328 flow. Second operand has 89 states, 89 states have (on average 88.48314606741573) internal successors, (7875), 89 states have internal predecessors, (7875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:05,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 15:54:05,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 99 [2022-04-18 15:54:05,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 15:54:08,344 INFO L129 PetriNetUnfolder]: 15/555 cut-off events. [2022-04-18 15:54:08,344 INFO L130 PetriNetUnfolder]: For 7134/7137 co-relation queries the response was YES. [2022-04-18 15:54:08,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 555 events. 15/555 cut-off events. For 7134/7137 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 572 event pairs, 0 based on Foata normal form. 12/554 useless extension candidates. Maximal degree in co-relation 1660. Up to 82 conditions per place. [2022-04-18 15:54:08,351 INFO L132 encePairwiseOnDemand]: 93/99 looper letters, 91 selfloop transitions, 129 changer transitions 0/304 dead transitions. [2022-04-18 15:54:08,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 304 transitions, 2832 flow [2022-04-18 15:54:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-18 15:54:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2022-04-18 15:54:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 11326 transitions. [2022-04-18 15:54:08,364 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8868530263879101 [2022-04-18 15:54:08,364 INFO L72 ComplementDD]: Start complementDD. Operand 129 states and 11326 transitions. [2022-04-18 15:54:08,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 11326 transitions. [2022-04-18 15:54:08,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 15:54:08,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 129 states and 11326 transitions. [2022-04-18 15:54:08,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 130 states, 129 states have (on average 87.7984496124031) internal successors, (11326), 129 states have internal predecessors, (11326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:08,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 130 states, 130 states have (on average 99.0) internal successors, (12870), 130 states have internal predecessors, (12870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:08,434 INFO L81 ComplementDD]: Finished complementDD. Result has 130 states, 130 states have (on average 99.0) internal successors, (12870), 130 states have internal predecessors, (12870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:08,434 INFO L186 Difference]: Start difference. First operand has 267 places, 187 transitions, 1328 flow. Second operand 129 states and 11326 transitions. [2022-04-18 15:54:08,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 304 transitions, 2832 flow [2022-04-18 15:54:08,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 304 transitions, 2688 flow, removed 30 selfloop flow, removed 42 redundant places. [2022-04-18 15:54:08,463 INFO L242 Difference]: Finished difference. Result has 366 places, 224 transitions, 1926 flow [2022-04-18 15:54:08,464 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=1926, PETRI_PLACES=366, PETRI_TRANSITIONS=224} [2022-04-18 15:54:08,465 INFO L335 CegarLoopForPetriNet]: 90 programPoint places, 276 predicate places. [2022-04-18 15:54:08,465 INFO L478 AbstractCegarLoop]: Abstraction has has 366 places, 224 transitions, 1926 flow [2022-04-18 15:54:08,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 88.48314606741573) internal successors, (7875), 89 states have internal predecessors, (7875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 15:54:08,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 15:54:08,467 INFO L255 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 15:54:08,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 15:54:08,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 15:54:08,683 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-04-18 15:54:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 15:54:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1833153217, now seen corresponding path program 6 times [2022-04-18 15:54:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 15:54:08,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801283616] [2022-04-18 15:54:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 15:54:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 15:54:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:54:08,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 15:54:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 15:54:08,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 15:54:08,989 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 15:54:08,989 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-04-18 15:54:08,991 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-04-18 15:54:08,991 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-04-18 15:54:08,992 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-04-18 15:54:08,992 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2022-04-18 15:54:08,992 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-04-18 15:54:08,992 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-04-18 15:54:08,993 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-04-18 15:54:08,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 15:54:08,996 INFO L719 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2022-04-18 15:54:09,002 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 15:54:09,002 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 15:54:09,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 03:54:09 BasicIcfg [2022-04-18 15:54:09,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 15:54:09,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 15:54:09,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 15:54:09,190 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 15:54:09,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:53:52" (3/4) ... [2022-04-18 15:54:09,192 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 15:54:09,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 15:54:09,193 INFO L158 Benchmark]: Toolchain (without parser) took 17334.59ms. Allocated memory was 92.3MB in the beginning and 209.7MB in the end (delta: 117.4MB). Free memory was 52.8MB in the beginning and 133.5MB in the end (delta: -80.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-04-18 15:54:09,193 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:54:09,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.91ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 52.6MB in the beginning and 88.4MB in the end (delta: -35.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-04-18 15:54:09,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.21ms. Allocated memory is still 119.5MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 15:54:09,194 INFO L158 Benchmark]: Boogie Preprocessor took 33.66ms. Allocated memory is still 119.5MB. Free memory was 86.3MB in the beginning and 84.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:54:09,194 INFO L158 Benchmark]: RCFGBuilder took 426.61ms. Allocated memory is still 119.5MB. Free memory was 84.8MB in the beginning and 71.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-04-18 15:54:09,195 INFO L158 Benchmark]: TraceAbstraction took 16403.58ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 71.1MB in the beginning and 133.5MB in the end (delta: -62.3MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. [2022-04-18 15:54:09,195 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 209.7MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 15:54:09,197 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.91ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 52.6MB in the beginning and 88.4MB in the end (delta: -35.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.21ms. Allocated memory is still 119.5MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.66ms. Allocated memory is still 119.5MB. Free memory was 86.3MB in the beginning and 84.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 426.61ms. Allocated memory is still 119.5MB. Free memory was 84.8MB in the beginning and 71.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16403.58ms. Allocated memory was 119.5MB in the beginning and 209.7MB in the end (delta: 90.2MB). Free memory was 71.1MB in the beginning and 133.5MB in the end (delta: -62.3MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 209.7MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [cond={4:0}, lock={3:0}] [L699] 0 int x; VAL [cond={4:0}, lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [cond={4:0}, lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [cond={4:0}, lock={3:0}, t={7:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [arg={0:0}, cond={4:0}, lock={3:0}, pthread_create( &t, ((void *)0), thread, ((void *)0) )=-1, t={7:0}, x=0, x_set=0] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=0, x_set=0] [L713] 0 int i = 0; VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=1, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=1, lock={3:0}, t={7:0}, x=0, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=1, lock={3:0}, t={7:0}, x=1, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=2, lock={3:0}, t={7:0}, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=2, lock={3:0}, t={7:0}, x=1, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=2, lock={3:0}, t={7:0}, x=2, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=3, lock={3:0}, t={7:0}, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=3, lock={3:0}, t={7:0}, x=2, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=3, lock={3:0}, t={7:0}, x=3, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=4, lock={3:0}, t={7:0}, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=4, lock={3:0}, t={7:0}, x=3, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=4, lock={3:0}, t={7:0}, x=4, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=5, lock={3:0}, t={7:0}, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=5, lock={3:0}, t={7:0}, x=4, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=5, lock={3:0}, t={7:0}, x=5, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=6, lock={3:0}, t={7:0}, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=6, lock={3:0}, t={7:0}, x=5, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=6, lock={3:0}, t={7:0}, x=6, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=7, lock={3:0}, t={7:0}, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=7, lock={3:0}, t={7:0}, x=6, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=7, lock={3:0}, t={7:0}, x=7, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=8, lock={3:0}, t={7:0}, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=8, lock={3:0}, t={7:0}, x=7, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=8, lock={3:0}, t={7:0}, x=8, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=9, lock={3:0}, t={7:0}, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=9, lock={3:0}, t={7:0}, x=8, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=9, lock={3:0}, t={7:0}, x=9, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=10, lock={3:0}, t={7:0}, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=10, lock={3:0}, t={7:0}, x=9, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=10, lock={3:0}, t={7:0}, x=10, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=11, lock={3:0}, t={7:0}, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=11, lock={3:0}, t={7:0}, x=10, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=11, lock={3:0}, t={7:0}, x=11, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=12, lock={3:0}, t={7:0}, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=12, lock={3:0}, t={7:0}, x=11, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=12, lock={3:0}, t={7:0}, x=12, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=13, lock={3:0}, t={7:0}, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=13, lock={3:0}, t={7:0}, x=12, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=13, lock={3:0}, t={7:0}, x=13, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=14, lock={3:0}, t={7:0}, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=14, lock={3:0}, t={7:0}, x=13, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=14, lock={3:0}, t={7:0}, x=14, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=15, lock={3:0}, t={7:0}, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=15, lock={3:0}, t={7:0}, x=14, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=15, lock={3:0}, t={7:0}, x=15, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=16, lock={3:0}, t={7:0}, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=16, lock={3:0}, t={7:0}, x=15, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=16, lock={3:0}, t={7:0}, x=16, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=17, lock={3:0}, t={7:0}, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=17, lock={3:0}, t={7:0}, x=16, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=17, lock={3:0}, t={7:0}, x=17, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=18, lock={3:0}, t={7:0}, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=18, lock={3:0}, t={7:0}, x=17, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=18, lock={3:0}, t={7:0}, x=18, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=19, lock={3:0}, t={7:0}, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=19, lock={3:0}, t={7:0}, x=18, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=19, lock={3:0}, t={7:0}, x=19, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=20, lock={3:0}, t={7:0}, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=20, lock={3:0}, t={7:0}, x=19, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=20, lock={3:0}, t={7:0}, x=20, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=21, lock={3:0}, t={7:0}, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=21, lock={3:0}, t={7:0}, x=20, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=21, lock={3:0}, t={7:0}, x=21, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=22, lock={3:0}, t={7:0}, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=22, lock={3:0}, t={7:0}, x=21, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=22, lock={3:0}, t={7:0}, x=22, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=23, lock={3:0}, t={7:0}, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=23, lock={3:0}, t={7:0}, x=22, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=23, lock={3:0}, t={7:0}, x=23, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=24, lock={3:0}, t={7:0}, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=24, lock={3:0}, t={7:0}, x=23, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=24, lock={3:0}, t={7:0}, x=24, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=25, lock={3:0}, t={7:0}, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=25, lock={3:0}, t={7:0}, x=24, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=25, lock={3:0}, t={7:0}, x=25, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=26, lock={3:0}, t={7:0}, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=26, lock={3:0}, t={7:0}, x=25, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=26, lock={3:0}, t={7:0}, x=26, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=27, lock={3:0}, t={7:0}, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=27, lock={3:0}, t={7:0}, x=26, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=27, lock={3:0}, t={7:0}, x=27, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=28, lock={3:0}, t={7:0}, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=28, lock={3:0}, t={7:0}, x=27, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=28, lock={3:0}, t={7:0}, x=28, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=29, lock={3:0}, t={7:0}, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=29, lock={3:0}, t={7:0}, x=28, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=29, lock={3:0}, t={7:0}, x=29, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=30, lock={3:0}, t={7:0}, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=30, lock={3:0}, t={7:0}, x=29, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=30, lock={3:0}, t={7:0}, x=30, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=31, lock={3:0}, t={7:0}, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=31, lock={3:0}, t={7:0}, x=30, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=31, lock={3:0}, t={7:0}, x=31, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=32, lock={3:0}, t={7:0}, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=32, lock={3:0}, t={7:0}, x=31, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=32, lock={3:0}, t={7:0}, x=32, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=33, lock={3:0}, t={7:0}, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=33, lock={3:0}, t={7:0}, x=32, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=33, lock={3:0}, t={7:0}, x=33, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=34, lock={3:0}, t={7:0}, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=34, lock={3:0}, t={7:0}, x=33, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=34, lock={3:0}, t={7:0}, x=34, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=35, lock={3:0}, t={7:0}, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=35, lock={3:0}, t={7:0}, x=34, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=35, lock={3:0}, t={7:0}, x=35, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=36, lock={3:0}, t={7:0}, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=36, lock={3:0}, t={7:0}, x=35, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=36, lock={3:0}, t={7:0}, x=36, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=37, lock={3:0}, t={7:0}, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=37, lock={3:0}, t={7:0}, x=36, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=37, lock={3:0}, t={7:0}, x=37, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=38, lock={3:0}, t={7:0}, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=38, lock={3:0}, t={7:0}, x=37, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=38, lock={3:0}, t={7:0}, x=38, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=39, lock={3:0}, t={7:0}, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=39, lock={3:0}, t={7:0}, x=38, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=39, lock={3:0}, t={7:0}, x=39, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=40, lock={3:0}, t={7:0}, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=40, lock={3:0}, t={7:0}, x=39, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=40, lock={3:0}, t={7:0}, x=40, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=41, lock={3:0}, t={7:0}, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=41, lock={3:0}, t={7:0}, x=40, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=41, lock={3:0}, t={7:0}, x=41, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=42, lock={3:0}, t={7:0}, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=42, lock={3:0}, t={7:0}, x=41, x_set=0] [L714] 0 x = i VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=42, lock={3:0}, t={7:0}, x=42, x_set=0] [L713] 0 i++ VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=0] [L715] 0 x_set = 1 VAL [arg={0:0}, arg={0:0}, cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=1, x_set = 1=128] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.1s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 584 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 857 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 56 mSDtfsCounter, 857 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1948 GetRequests, 1544 SyntacticMatches, 0 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1926occurred in iteration=11, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2379 NumberOfCodeBlocks, 2379 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2699 ConstructedInterpolants, 0 QuantifiedInterpolants, 5867 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1625 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1/16211 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-18 15:54:09,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE