./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.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/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22ccde2ce516925ebfe813d783d47f1167b5115e5910734aa9e1bf526ce8c733 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 17:26:19,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 17:26:19,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 17:26:19,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 17:26:19,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 17:26:19,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 17:26:19,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 17:26:19,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 17:26:19,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 17:26:19,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 17:26:19,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 17:26:19,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 17:26:19,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 17:26:19,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 17:26:19,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 17:26:19,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 17:26:19,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 17:26:19,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 17:26:19,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 17:26:19,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 17:26:19,724 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 17:26:19,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 17:26:19,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 17:26:19,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 17:26:19,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 17:26:19,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 17:26:19,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 17:26:19,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 17:26:19,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 17:26:19,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 17:26:19,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 17:26:19,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 17:26:19,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 17:26:19,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 17:26:19,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 17:26:19,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 17:26:19,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 17:26:19,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 17:26:19,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 17:26:19,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 17:26:19,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 17:26:19,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 17:26:19,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-04-18 17:26:19,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 17:26:19,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 17:26:19,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 17:26:19,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 17:26:19,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 17:26:19,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 17:26:19,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 17:26:19,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 17:26:19,764 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 17:26:19,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 17:26:19,764 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 17:26:19,764 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 17:26:19,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 17:26:19,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 17:26:19,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 17:26:19,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 17:26:19,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 17:26:19,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 17:26:19,766 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 17:26:19,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 17:26:19,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 17:26:19,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 17:26:19,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 17:26:19,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 17:26:19,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 17:26:19,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-18 17:26:19,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 17:26:19,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:26:19,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 17:26:19,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 17:26:19,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 17:26:19,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 17:26:19,769 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-04-18 17:26:19,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 17:26:19,769 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 17:26:19,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-04-18 17:26:19,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 17:26:19,770 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-04-18 17:26:19,770 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-04-18 17:26:19,770 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/UGemCutter-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/UGemCutter-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 -> GemCutter 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 -> 22ccde2ce516925ebfe813d783d47f1167b5115e5910734aa9e1bf526ce8c733 [2022-04-18 17:26:19,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 17:26:20,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 17:26:20,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 17:26:20,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 17:26:20,010 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 17:26:20,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i [2022-04-18 17:26:20,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c6155295/b17219547d3248fdbd3e70d2e7ef4f7c/FLAG99597062f [2022-04-18 17:26:20,495 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 17:26:20,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i [2022-04-18 17:26:20,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c6155295/b17219547d3248fdbd3e70d2e7ef4f7c/FLAG99597062f [2022-04-18 17:26:20,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c6155295/b17219547d3248fdbd3e70d2e7ef4f7c [2022-04-18 17:26:20,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 17:26:20,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 17:26:20,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 17:26:20,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 17:26:20,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 17:26:20,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2208bf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20, skipping insertion in model container [2022-04-18 17:26:20,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 17:26:20,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 17:26:20,859 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-ext/47_ticket_lock_hc_backoff_vs.i[30336,30349] [2022-04-18 17:26:20,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:26:20,871 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 17:26:20,909 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-ext/47_ticket_lock_hc_backoff_vs.i[30336,30349] [2022-04-18 17:26:20,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:26:20,937 INFO L208 MainTranslator]: Completed translation [2022-04-18 17:26:20,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20 WrapperNode [2022-04-18 17:26:20,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 17:26:20,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 17:26:20,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 17:26:20,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 17:26:20,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,988 INFO L137 Inliner]: procedures = 169, calls = 18, calls flagged for inlining = 5, calls inlined = 7, statements flattened = 188 [2022-04-18 17:26:20,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 17:26:20,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 17:26:20,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 17:26:20,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 17:26:20,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:20,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:21,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:21,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:21,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:21,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 17:26:21,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 17:26:21,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 17:26:21,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 17:26:21,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (1/1) ... [2022-04-18 17:26:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:26:21,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:21,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 17:26:21,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 17:26:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 17:26:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-04-18 17:26:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-04-18 17:26:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 17:26:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 17:26:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 17:26:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 17:26:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 17:26:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 17:26:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 17:26:21,097 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 17:26:21,197 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 17:26:21,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 17:26:21,457 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 17:26:21,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 17:26:21,583 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-18 17:26:21,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:26:21 BoogieIcfgContainer [2022-04-18 17:26:21,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 17:26:21,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 17:26:21,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 17:26:21,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 17:26:21,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 05:26:20" (1/3) ... [2022-04-18 17:26:21,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6c6d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:26:21, skipping insertion in model container [2022-04-18 17:26:21,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:26:20" (2/3) ... [2022-04-18 17:26:21,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6c6d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:26:21, skipping insertion in model container [2022-04-18 17:26:21,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:26:21" (3/3) ... [2022-04-18 17:26:21,591 INFO L111 eAbstractionObserver]: Analyzing ICFG 47_ticket_lock_hc_backoff_vs.i [2022-04-18 17:26:21,595 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 17:26:21,595 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 17:26:21,595 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-04-18 17:26:21,596 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 17:26:21,636 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:26:21,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:26:21,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:21,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:26:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-04-18 17:26:21,736 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2022-04-18 17:26:21,742 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=PARTIAL_ORDER_FA, 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 17:26:21,742 INFO L341 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-04-18 17:26:23,109 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1514594659, now seen corresponding path program 1 times [2022-04-18 17:26:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:23,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684665297] [2022-04-18 17:26:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:23,309 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 17:26:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684665297] [2022-04-18 17:26:23,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684665297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:23,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:23,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:26:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525489338] [2022-04-18 17:26:23,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:23,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:26:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:23,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:26:23,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:26:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,343 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:23,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 17:26:23,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 17:26:23,396 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1141338934, now seen corresponding path program 1 times [2022-04-18 17:26:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:23,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779847597] [2022-04-18 17:26:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 17:26:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:23,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779847597] [2022-04-18 17:26:23,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779847597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:23,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:23,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:26:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856953343] [2022-04-18 17:26:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:23,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,523 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:23,523 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 17:26:23,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:23,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 17:26:23,684 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1542571548, now seen corresponding path program 1 times [2022-04-18 17:26:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:23,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269191078] [2022-04-18 17:26:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 17:26:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269191078] [2022-04-18 17:26:23,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269191078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:26:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322374555] [2022-04-18 17:26:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:23,869 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:26:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:26:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:26:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,879 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:23,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 17:26:23,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:23,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:23,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 17:26:24,031 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -30623212, now seen corresponding path program 1 times [2022-04-18 17:26:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:24,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271556119] [2022-04-18 17:26:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 17:26:24,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271556119] [2022-04-18 17:26:24,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271556119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:24,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:26:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499972928] [2022-04-18 17:26:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:24,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:24,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,126 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:24,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 17:26:24,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 17:26:24,220 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1913867185, now seen corresponding path program 1 times [2022-04-18 17:26:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:24,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040817966] [2022-04-18 17:26:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 17:26:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040817966] [2022-04-18 17:26:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040817966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:24,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:24,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:26:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801174420] [2022-04-18 17:26:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:24,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:24,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,304 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:24,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 17:26:24,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 17:26:24,351 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 731636563, now seen corresponding path program 1 times [2022-04-18 17:26:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590656485] [2022-04-18 17:26:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 17:26:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590656485] [2022-04-18 17:26:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590656485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:24,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:26:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215307300] [2022-04-18 17:26:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:24,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,430 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:24,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 17:26:24,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 17:26:24,465 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -841705288, now seen corresponding path program 1 times [2022-04-18 17:26:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:24,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152832018] [2022-04-18 17:26:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 17:26:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:24,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152832018] [2022-04-18 17:26:24,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152832018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:24,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:24,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:26:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782608527] [2022-04-18 17:26:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:24,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,549 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:24,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 17:26:24,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:24,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:24,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:24,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:25,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 17:26:25,125 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 162022256, now seen corresponding path program 1 times [2022-04-18 17:26:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:25,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387403829] [2022-04-18 17:26:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:26:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:25,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387403829] [2022-04-18 17:26:25,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387403829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:26:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510403665] [2022-04-18 17:26:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:25,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:25,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:26:25,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 17:26:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:25,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-18 17:26:25,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:26:25,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-18 17:26:25,974 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 17:26:25,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 17:26:26,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 17:26:26,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-18 17:26:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:26:26,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:26:26,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_330) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0)) is different from false [2022-04-18 17:26:26,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_thr1_~#l~0#1.base_33| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int)) (or (= (select (select (store |c_#race| |v_ULTIMATE.start_thr1_~#l~0#1.base_33| v_ArrVal_330) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0) (not (= (select (store |c_#valid| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_329) |v_ULTIMATE.start_thr1_~#l~0#1.base_33|) 0)))) is different from false [2022-04-18 17:26:26,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 17:26:26,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-18 17:26:26,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-04-18 17:26:26,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-04-18 17:26:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-18 17:26:28,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510403665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:26:28,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:26:28,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 35 [2022-04-18 17:26:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767212854] [2022-04-18 17:26:28,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:26:28,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-18 17:26:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-18 17:26:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=856, Unknown=4, NotChecked=126, Total=1190 [2022-04-18 17:26:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:28,289 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:28,290 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.771428571428572) internal successors, (342), 35 states have internal predecessors, (342), 0 states have call successors, (0), 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 17:26:28,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:28,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:28,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:28,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:28,796 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base|) |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0) (not (= |c_ULTIMATE.start_thr1_~#l~0#1.base| |c_thr1Thread1of1ForFork0_~#l~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_thr1_~#l~0#1.base|) 1) (forall ((|v_ULTIMATE.start_thr1_~#l~0#1.base_33| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int)) (or (= (select (select (store |c_#race| |v_ULTIMATE.start_thr1_~#l~0#1.base_33| v_ArrVal_330) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0) (not (= (select (store |c_#valid| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_329) |v_ULTIMATE.start_thr1_~#l~0#1.base_33|) 0)))) (= (select |c_#valid| |c_thr1Thread1of1ForFork0_~#l~0#1.base|) 1)) is different from false [2022-04-18 17:26:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:26:31,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 17:26:31,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-18 17:26:31,788 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -505477054, now seen corresponding path program 1 times [2022-04-18 17:26:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:31,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483571837] [2022-04-18 17:26:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-04-18 17:26:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:31,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483571837] [2022-04-18 17:26:31,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483571837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:31,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:31,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:26:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952621518] [2022-04-18 17:26:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:31,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:31,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:31,961 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:31,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 17:26:31,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:31,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:31,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:31,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:26:31,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:26:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 17:26:32,076 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1488941339, now seen corresponding path program 1 times [2022-04-18 17:26:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:32,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231569777] [2022-04-18 17:26:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2022-04-18 17:26:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231569777] [2022-04-18 17:26:32,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231569777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:32,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:32,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:26:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916902279] [2022-04-18 17:26:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:32,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:32,251 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:32,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 17:26:32,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:32,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:32,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 17:26:32,307 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1488941308, now seen corresponding path program 1 times [2022-04-18 17:26:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:32,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138422396] [2022-04-18 17:26:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 360 proven. 18 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-04-18 17:26:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138422396] [2022-04-18 17:26:32,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138422396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:26:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624509842] [2022-04-18 17:26:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:32,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:32,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:26:32,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 17:26:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:33,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-18 17:26:33,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:26:33,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 17:26:34,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-04-18 17:26:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 360 proven. 22 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2022-04-18 17:26:34,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:26:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 364 proven. 18 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2022-04-18 17:26:35,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624509842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:26:35,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:26:35,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 23 [2022-04-18 17:26:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904574401] [2022-04-18 17:26:35,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:26:35,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-18 17:26:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-18 17:26:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-18 17:26:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:35,408 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:35,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.956521739130435) internal successors, (367), 23 states have internal predecessors, (367), 0 states have call successors, (0), 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 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-04-18 17:26:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:26:36,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-18 17:26:36,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:36,400 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash -827833868, now seen corresponding path program 1 times [2022-04-18 17:26:36,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:36,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253883609] [2022-04-18 17:26:36,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 39 proven. 31 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-18 17:26:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:36,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253883609] [2022-04-18 17:26:36,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253883609] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:26:36,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918414932] [2022-04-18 17:26:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:36,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:36,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:26:36,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 17:26:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:36,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-18 17:26:36,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:26:37,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-18 17:26:37,132 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 17:26:37,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 17:26:37,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-18 17:26:37,520 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 17:26:37,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 17:26:37,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-18 17:26:37,769 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 17:26:37,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 17:26:38,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-18 17:26:38,087 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 17:26:38,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-04-18 17:26:38,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 17:26:38,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-04-18 17:26:38,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 17:26:38,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 17:26:38,370 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:26:38,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:26:38,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 17:26:38,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:26:38,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 17:26:38,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 17:26:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 27 proven. 77 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-18 17:26:38,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:26:38,526 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_1386) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) (+ |c_thr1Thread1of1ForFork0_~#l~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_1386) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) (+ 2 |c_thr1Thread1of1ForFork0_~#l~0#1.offset|)) 0)) (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_1386) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0))) is different from false [2022-04-18 17:26:38,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_ULTIMATE.start_thr1_~#l~0#1.base_47| Int)) (or (and (forall ((v_ArrVal_1386 (Array Int Int))) (= (let ((.cse0 (+ |c_thr1Thread1of1ForFork0_~#l~0#1.offset| 1))) (select (select (store (store |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base| (store (store (select |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base|) .cse0 0) (+ 2 |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0)) |v_ULTIMATE.start_thr1_~#l~0#1.base_47| v_ArrVal_1386) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store (store |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base| (store (store (select |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base|) (+ |c_thr1Thread1of1ForFork0_~#l~0#1.offset| 1) 0) (+ 2 |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0)) |v_ULTIMATE.start_thr1_~#l~0#1.base_47| v_ArrVal_1386) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) |c_thr1Thread1of1ForFork0_~#l~0#1.offset|) 0)) (forall ((v_ArrVal_1386 (Array Int Int))) (= (let ((.cse1 (+ 2 |c_thr1Thread1of1ForFork0_~#l~0#1.offset|))) (select (select (store (store |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base| (store (store (select |c_#race| |c_thr1Thread1of1ForFork0_~#l~0#1.base|) (+ |c_thr1Thread1of1ForFork0_~#l~0#1.offset| 1) 0) .cse1 0)) |v_ULTIMATE.start_thr1_~#l~0#1.base_47| v_ArrVal_1386) |c_thr1Thread1of1ForFork0_~#l~0#1.base|) .cse1)) 0))) (not (= (select (store |c_#valid| |c_ULTIMATE.start_thr1_~#l~0#1.base| v_ArrVal_1381) |v_ULTIMATE.start_thr1_~#l~0#1.base_47|) 0)))) is different from false [2022-04-18 17:26:38,851 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-04-18 17:26:38,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2022-04-18 17:26:38,857 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 17:26:38,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 30 [2022-04-18 17:26:38,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-04-18 17:26:38,883 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-04-18 17:26:38,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-04-18 17:26:38,889 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 17:26:38,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 32 [2022-04-18 17:26:38,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-18 17:26:38,925 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-04-18 17:26:38,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-04-18 17:26:38,932 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 17:26:38,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 32 [2022-04-18 17:26:38,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-18 17:26:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 62 proven. 29 refuted. 4 times theorem prover too weak. 62 trivial. 3 not checked. [2022-04-18 17:26:40,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918414932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:26:40,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:26:40,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 16] total 39 [2022-04-18 17:26:40,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490991377] [2022-04-18 17:26:40,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:26:40,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-18 17:26:40,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:40,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-18 17:26:40,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1153, Unknown=8, NotChecked=146, Total=1560 [2022-04-18 17:26:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:40,781 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:40,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 11.487179487179487) internal successors, (448), 40 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:26:40,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:40,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:40,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:26:40,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:26:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:42,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 17:26:42,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:42,464 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1063381209, now seen corresponding path program 1 times [2022-04-18 17:26:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:42,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747001609] [2022-04-18 17:26:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:42,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-04-18 17:26:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747001609] [2022-04-18 17:26:42,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747001609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:26:42,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:26:42,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:26:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664367740] [2022-04-18 17:26:42,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:26:42,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:26:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:42,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:26:42,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:26:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:42,546 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:42,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:42,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:26:42,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:42,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:42,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:26:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:42,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 17:26:42,590 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1063381240, now seen corresponding path program 1 times [2022-04-18 17:26:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:42,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659191575] [2022-04-18 17:26:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 113 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-18 17:26:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:42,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659191575] [2022-04-18 17:26:42,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659191575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:26:42,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924797852] [2022-04-18 17:26:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:42,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:42,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:26:42,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 17:26:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:43,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-18 17:26:43,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:26:43,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-18 17:26:44,201 INFO L356 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2022-04-18 17:26:44,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-04-18 17:26:44,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-04-18 17:26:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 113 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-18 17:26:44,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:26:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:26:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924797852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:26:45,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:26:45,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 9] total 29 [2022-04-18 17:26:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719792043] [2022-04-18 17:26:45,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:26:45,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-18 17:26:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-18 17:26:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-04-18 17:26:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:45,133 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:45,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 15.482758620689655) internal successors, (449), 29 states have internal predecessors, (449), 0 states have call successors, (0), 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 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:26:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:45,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:26:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-18 17:26:46,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-18 17:26:46,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-18 17:26:46,300 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1549125159, now seen corresponding path program 1 times [2022-04-18 17:26:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:46,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925109540] [2022-04-18 17:26:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 222 proven. 144 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-18 17:26:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:26:46,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925109540] [2022-04-18 17:26:46,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925109540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:26:46,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785049019] [2022-04-18 17:26:46,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:26:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:26:46,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:26:46,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 17:26:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:26:46,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-18 17:26:46,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:26:48,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 17:26:48,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-04-18 17:26:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 222 proven. 164 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-18 17:26:48,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:26:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 222 proven. 83 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-18 17:26:49,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785049019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:26:49,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:26:49,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 10] total 31 [2022-04-18 17:26:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333844594] [2022-04-18 17:26:49,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:26:49,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-18 17:26:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:26:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-18 17:26:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2022-04-18 17:26:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:49,153 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:26:49,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 17.516129032258064) internal successors, (543), 31 states have internal predecessors, (543), 0 states have call successors, (0), 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 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-04-18 17:26:49,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:26:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:26:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-18 17:26:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:26:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-18 17:26:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:26:50,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 17:26:50,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-18 17:26:50,483 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-04-18 17:26:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:26:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash 677113457, now seen corresponding path program 1 times [2022-04-18 17:26:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:26:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669381808] [2022-04-18 17:26:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:26:50,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:26:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:26:50,585 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:26:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:26:50,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:26:50,851 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:26:50,852 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2022-04-18 17:26:50,854 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2022-04-18 17:26:50,855 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2022-04-18 17:26:50,855 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2022-04-18 17:26:50,855 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2022-04-18 17:26:50,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 17:26:50,861 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 17:26:50,862 INFO L306 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-04-18 17:26:50,867 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 17:26:50,867 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 17:26:51,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 05:26:51 BasicIcfg [2022-04-18 17:26:51,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 17:26:51,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 17:26:51,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 17:26:51,099 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 17:26:51,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:26:21" (3/4) ... [2022-04-18 17:26:51,102 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 17:26:51,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 17:26:51,102 INFO L158 Benchmark]: Toolchain (without parser) took 30579.38ms. Allocated memory was 86.0MB in the beginning and 283.1MB in the end (delta: 197.1MB). Free memory was 54.7MB in the beginning and 97.1MB in the end (delta: -42.5MB). Peak memory consumption was 154.8MB. Max. memory is 16.1GB. [2022-04-18 17:26:51,103 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 39.9MB in the beginning and 39.8MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 17:26:51,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.13ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 54.5MB in the beginning and 78.3MB in the end (delta: -23.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 17:26:51,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.70ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 75.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 17:26:51,103 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 111.1MB. Free memory was 75.8MB in the beginning and 73.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 17:26:51,104 INFO L158 Benchmark]: RCFGBuilder took 553.60ms. Allocated memory is still 111.1MB. Free memory was 73.8MB in the beginning and 82.5MB in the end (delta: -8.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-04-18 17:26:51,104 INFO L158 Benchmark]: TraceAbstraction took 29512.41ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 81.9MB in the beginning and 97.1MB in the end (delta: -15.2MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2022-04-18 17:26:51,104 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 283.1MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 17:26:51,105 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.18ms. Allocated memory is still 86.0MB. Free memory was 39.9MB in the beginning and 39.8MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.13ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 54.5MB in the beginning and 78.3MB in the end (delta: -23.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.70ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 75.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 111.1MB. Free memory was 75.8MB in the beginning and 73.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.60ms. Allocated memory is still 111.1MB. Free memory was 73.8MB in the beginning and 82.5MB in the end (delta: -8.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29512.41ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 81.9MB in the beginning and 97.1MB in the end (delta: -15.2MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 283.1MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24149, positive: 18706, positive conditional: 7690, positive unconditional: 11016, negative: 5443, negative conditional: 5306, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18953, positive: 18706, positive conditional: 7690, positive unconditional: 11016, negative: 247, negative conditional: 110, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18953, positive: 18706, positive conditional: 7690, positive unconditional: 11016, negative: 247, negative conditional: 110, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19476, positive: 18706, positive conditional: 7247, positive unconditional: 11459, negative: 770, negative conditional: 523, negative unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19476, positive: 18706, positive conditional: 2944, positive unconditional: 15762, negative: 770, negative conditional: 87, negative unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19476, positive: 18706, positive conditional: 2944, positive unconditional: 15762, negative: 770, negative conditional: 87, negative unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7656, positive: 7453, positive conditional: 48, positive unconditional: 7405, negative: 203, negative conditional: 50, negative unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7656, positive: 7199, positive conditional: 0, positive unconditional: 7199, negative: 457, negative conditional: 0, negative unconditional: 457, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 457, positive: 254, positive conditional: 48, positive unconditional: 206, negative: 196, negative conditional: 49, negative unconditional: 147, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5313, positive: 466, positive conditional: 98, positive unconditional: 368, negative: 445, negative conditional: 193, negative unconditional: 253, unknown: 4402, unknown conditional: 1022, unknown unconditional: 3380] ], Cache Queries: [ total: 19476, positive: 11253, positive conditional: 2896, positive unconditional: 8357, negative: 567, negative conditional: 37, negative unconditional: 530, unknown: 7656, unknown conditional: 98, unknown unconditional: 7558] , Statistics on independence cache: Total cache size (in pairs): 7656, Positive cache size: 7453, Positive conditional cache size: 48, Positive unconditional cache size: 7405, Negative cache size: 203, Negative conditional cache size: 50, Negative unconditional cache size: 153, Eliminated conditions: 4739, Maximal queried relation: 8, Independence queries for same thread: 5196 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 4.1s, Number of persistent set computation: 1016, Number of trivial persistent sets: 951, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11153, positive: 11016, positive conditional: 0, positive unconditional: 11016, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24149, positive: 18706, positive conditional: 7690, positive unconditional: 11016, negative: 5443, negative conditional: 5306, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18953, positive: 18706, positive conditional: 7690, positive unconditional: 11016, negative: 247, negative conditional: 110, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18953, positive: 18706, positive conditional: 7690, positive unconditional: 11016, negative: 247, negative conditional: 110, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19476, positive: 18706, positive conditional: 7247, positive unconditional: 11459, negative: 770, negative conditional: 523, negative unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19476, positive: 18706, positive conditional: 2944, positive unconditional: 15762, negative: 770, negative conditional: 87, negative unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19476, positive: 18706, positive conditional: 2944, positive unconditional: 15762, negative: 770, negative conditional: 87, negative unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7656, positive: 7453, positive conditional: 48, positive unconditional: 7405, negative: 203, negative conditional: 50, negative unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7656, positive: 7199, positive conditional: 0, positive unconditional: 7199, negative: 457, negative conditional: 0, negative unconditional: 457, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 457, positive: 254, positive conditional: 48, positive unconditional: 206, negative: 196, negative conditional: 49, negative unconditional: 147, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5313, positive: 466, positive conditional: 98, positive unconditional: 368, negative: 445, negative conditional: 193, negative unconditional: 253, unknown: 4402, unknown conditional: 1022, unknown unconditional: 3380] ], Cache Queries: [ total: 19476, positive: 11253, positive conditional: 2896, positive unconditional: 8357, negative: 567, negative conditional: 37, negative unconditional: 530, unknown: 7656, unknown conditional: 98, unknown unconditional: 7558] , Statistics on independence cache: Total cache size (in pairs): 7656, Positive cache size: 7453, Positive conditional cache size: 48, Positive unconditional cache size: 7405, Negative cache size: 203, Negative conditional cache size: 50, Negative unconditional cache size: 153, Eliminated conditions: 4739, Maximal queried relation: 8, Independence queries for same thread: 5196 - 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: [L689] 0 volatile unsigned s = 0; VAL [s=0] [L690] 0 volatile unsigned t = 0; VAL [s=0, t=0] [L697] 0 unsigned c = 0; VAL [c=0, s=0, t=0] [L710] 0 pthread_t t; VAL [c=0, s=0, t=0, t={9:0}] [L711] COND TRUE 0 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, c=0, s=0, t={9:0}, t=0] [L711] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [c=0, pthread_create(&t, 0, thr1, 0)=-1, s=0, t=0, t={9:0}] [L700] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, c=0, s=0, t=0] [L701] 1 unsigned l; VAL [arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=0] [L702] CALL 1 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 1 t != -1 [L693] CALL 1 assume_abort_if_not(t != -1) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(t != -1) [L694] 1 *l = t [L695] EXPR 1 t + 1 [L695] 1 t = t + 1 [L702] RET 1 __VERIFIER_atomic_fetch_and_inc(&l) [L711] COND FALSE 0 !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, c=0, s=0, t={9:0}, t=1] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L712] CALL 0 thr1(0) [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L702] EXPR 1 \read(l) VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L702] 1 s == l VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L702] 1 s == l VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L700] COND TRUE 0 1 VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L702] 1 s == l VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, s=0, t=1] [L701] 0 unsigned l; VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=1] [L702] 1 s == l VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, l={11:0}, s=0, t=1] [L702] CALL 0 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 0 t != -1 [L693] CALL 0 assume_abort_if_not(t != -1) [L4] COND FALSE 0 !(!cond) [L693] RET 0 assume_abort_if_not(t != -1) [L694] 0 *l = t [L695] EXPR 0 t + 1 [L695] 0 t = t + 1 [L702] RET 0 __VERIFIER_atomic_fetch_and_inc(&l) [L702] COND TRUE 1 s == l VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L702] COND TRUE 0 1 VAL [\read(l)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L703] 1 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={10:0}, l={11:0}, s=0, t=2] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={10:0}, l={11:0}, s=0, t=2] [L702] EXPR 0 \read(l) VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={10:0}, l={11:0}, s=0, t=2] [L703] 1 c = 1 VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=63, l={10:0}, l={11:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=63, l={11:0}, l={10:0}, s=0, t=2] [L703] 1 c = 1 VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=63, l={10:0}, l={11:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=63, l={10:0}, l={11:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={10:0}, s=0, t=2] [L703] EXPR 1 c == 1 VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={10:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={10:0}, s=0, t=2] [L703] EXPR 1 c == 1 VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={10:0}, l={11:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={10:0}, l={11:0}, s=0, t=2] [L703] COND FALSE 1 !(!(c == 1)) VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={10:0}, s=0, t=2] [L702] COND FALSE 0 !(s == l) VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={10:0}, s=0, t=2] [L703] 1 c = 0 VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L702] COND TRUE 0 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=50, l={11:0}, l={10:0}, s=0, t=2] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=50, l={10:0}, l={11:0}, s=0, t=2] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=50, l={10:0}, l={11:0}, s=0, t=2] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=50, l={10:0}, l={11:0}, s=0, t=2] [L702] EXPR 0 \read(l) VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L704] 1 s++ VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L704] 1 s++ VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, l={11:0}, s=0, t=2] [L704] 1 s++ VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, l={11:0}, s=0, s++=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, l={11:0}, s=0, s++=0, t=2] [L704] 1 s++ VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=1, s++=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, l={11:0}, s=1, s++=0, t=2] [L702] 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=1, s++=0, t=2] [L704] 1 s++ VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={10:0}, l={11:0}, s=1, s++=0, s++=65, t=2] [L702] COND TRUE 0 s == l VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=1, s++=65, s++=0, t=2] [L704] 1 s++ VAL [\read(l)=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={10:0}, s=1, s++=65, s++=0, t=2] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={10:0}, l={11:0}, s=1, s++=65, t=2] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=71, l={11:0}, l={10:0}, s=1, t=2] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=71, l={11:0}, s=1, t=2] [L700] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=71, l={11:0}, s=1, t=2] [L701] 1 unsigned l; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={12:0}, s=1, t=2] [L703] EXPR 0 c == 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={12:0}, s=1, t=2] [L702] CALL 1 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 1 t != -1 [L693] CALL 1 assume_abort_if_not(t != -1) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(t != -1) [L694] 1 *l = t [L695] EXPR 1 t + 1 [L695] 1 t = t + 1 [L702] RET 1 __VERIFIER_atomic_fetch_and_inc(&l) [L703] EXPR 0 c == 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={11:0}, s=1, t=3] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={11:0}, l={12:0}, s=1, t=3] [L703] COND FALSE 0 !(!(c == 1)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={11:0}, s=1, t=3] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={11:0}, s=1, t=3] [L703] 0 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=1, t=3] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=1, t=3] [L702] EXPR 1 \read(l) VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=1, t=3] [L703] 0 c = 0 VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=66, l={12:0}, l={11:0}, s=1, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=66, l={12:0}, l={11:0}, s=1, t=3] [L703] 0 c = 0 VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=66, l={11:0}, l={12:0}, s=1, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=66, l={11:0}, l={12:0}, s=1, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=1, t=3] [L704] 0 s++ VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=1, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=1, t=3] [L704] 0 s++ VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=1, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=1, t=3] [L704] 0 s++ VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=1, s++=1, t=3] [L702] COND FALSE 1 !(s == l) VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=1, s++=1, t=3] [L704] 0 s++ VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=2, s++=1, t=3] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=2, s++=1, t=3] [L704] 0 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=2, s++=1, s++=0, t=3] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=2, s++=0, s++=1, t=3] [L704] 0 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=2, s++=0, s++=1, t=3] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=2, s++=1, s++=0, t=3] [L702] EXPR 1 \read(l) VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=2, s++=0, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={11:0}, l={12:0}, s=2, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={11:0}, s=2, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, s=2, t=3] [L700] COND TRUE 0 1 VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, s=2, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, s=2, t=3] [L701] 0 unsigned l; VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=3] [L702] 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=3] [L702] CALL 0 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 0 t != -1 [L693] CALL 0 assume_abort_if_not(t != -1) [L4] COND FALSE 0 !(!cond) [L693] RET 0 assume_abort_if_not(t != -1) [L694] 0 *l = t [L695] EXPR 0 t + 1 [L695] 0 t = t + 1 [L702] RET 0 __VERIFIER_atomic_fetch_and_inc(&l) [L702] COND TRUE 1 s == l VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L702] COND TRUE 0 1 VAL [\read(l)=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L703] 1 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=2, t=4] [L702] EXPR 0 \read(l) VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={12:0}, s=2, t=4] [L703] 1 c = 1 VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=61, l={13:0}, l={12:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=61, l={12:0}, l={13:0}, s=2, t=4] [L703] 1 c = 1 VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=61, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=61, l={13:0}, l={12:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=2, t=4] [L703] EXPR 1 c == 1 VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=2, t=4] [L703] EXPR 1 c == 1 VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={12:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={12:0}, s=2, t=4] [L703] COND FALSE 1 !(!(c == 1)) VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={12:0}, s=2, t=4] [L702] COND FALSE 0 !(s == l) VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=2, t=4] [L703] 1 c = 0 VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={12:0}, s=2, t=4] [L702] COND TRUE 0 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=52, l={13:0}, l={12:0}, s=2, t=4] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=52, l={13:0}, l={12:0}, s=2, t=4] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=52, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=52, l={13:0}, l={12:0}, s=2, t=4] [L702] EXPR 0 \read(l) VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={12:0}, s=2, t=4] [L704] 1 s++ VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L704] 1 s++ VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, t=4] [L704] 1 s++ VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, s++=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=2, s++=2, t=4] [L704] 1 s++ VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={12:0}, s=3, s++=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={12:0}, s=3, s++=2, t=4] [L702] 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=3, s++=2, t=4] [L704] 1 s++ VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=3, s++=2, s++=49, t=4] [L702] COND TRUE 0 s == l VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={12:0}, s=3, s++=49, s++=2, t=4] [L704] 1 s++ VAL [\read(l)=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={12:0}, l={13:0}, s=3, s++=49, s++=2, t=4] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={12:0}, l={13:0}, s=3, s++=49, t=4] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=69, l={13:0}, l={12:0}, s=3, t=4] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=69, l={13:0}, s=3, t=4] [L700] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=69, l={13:0}, s=3, t=4] [L701] 1 unsigned l; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={13:0}, s=3, t=4] [L703] EXPR 0 c == 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={13:0}, s=3, t=4] [L702] CALL 1 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 1 t != -1 [L693] CALL 1 assume_abort_if_not(t != -1) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(t != -1) [L694] 1 *l = t [L695] EXPR 1 t + 1 [L695] 1 t = t + 1 [L702] RET 1 __VERIFIER_atomic_fetch_and_inc(&l) [L703] EXPR 0 c == 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={14:0}, s=3, t=5] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={14:0}, s=3, t=5] [L703] COND FALSE 0 !(!(c == 1)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={13:0}, s=3, t=5] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={13:0}, l={14:0}, s=3, t=5] [L703] 0 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={13:0}, s=3, t=5] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, t=5] [L702] EXPR 1 \read(l) VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, t=5] [L703] 0 c = 0 VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=64, l={14:0}, l={13:0}, s=3, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=64, l={14:0}, l={13:0}, s=3, t=5] [L703] 0 c = 0 VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=64, l={13:0}, l={14:0}, s=3, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=64, l={13:0}, l={14:0}, s=3, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={13:0}, s=3, t=5] [L704] 0 s++ VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, t=5] [L704] 0 s++ VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, t=5] [L704] 0 s++ VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=3, s++=3, t=5] [L702] COND FALSE 1 !(s == l) VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={13:0}, s=3, s++=3, t=5] [L704] 0 s++ VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=4, s++=3, t=5] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=4, s++=3, t=5] [L704] 0 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=4, s++=0, s++=3, t=5] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={13:0}, s=4, s++=0, s++=3, t=5] [L704] 0 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=4, s++=0, s++=3, t=5] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=4, s++=3, s++=0, t=5] [L702] EXPR 1 \read(l) VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={13:0}, s=4, s++=0, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={13:0}, s=4, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={13:0}, l={14:0}, s=4, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, s=4, t=5] [L700] COND TRUE 0 1 VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, s=4, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, s=4, t=5] [L701] 0 unsigned l; VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=4, t=5] [L702] 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=4, t=5] [L702] CALL 0 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 0 t != -1 [L693] CALL 0 assume_abort_if_not(t != -1) [L4] COND FALSE 0 !(!cond) [L693] RET 0 assume_abort_if_not(t != -1) [L694] 0 *l = t [L695] EXPR 0 t + 1 [L695] 0 t = t + 1 [L702] RET 0 __VERIFIER_atomic_fetch_and_inc(&l) [L702] COND TRUE 1 s == l VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=4, t=6] [L702] COND TRUE 0 1 VAL [\read(l)=4, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, t=6] [L703] 1 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={14:0}, s=4, t=6] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=4, t=6] [L702] EXPR 0 \read(l) VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=4, t=6] [L703] 1 c = 1 VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=56, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=56, l={14:0}, l={15:0}, s=4, t=6] [L703] 1 c = 1 VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=56, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=56, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=4, t=6] [L703] EXPR 1 c == 1 VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={14:0}, s=4, t=6] [L703] EXPR 1 c == 1 VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={14:0}, s=4, t=6] [L703] COND FALSE 1 !(!(c == 1)) VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=4, t=6] [L702] COND FALSE 0 !(s == l) VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={14:0}, s=4, t=6] [L703] 1 c = 0 VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, t=6] [L702] COND TRUE 0 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, t=6] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=68, l={15:0}, l={14:0}, s=4, t=6] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=68, l={15:0}, l={14:0}, s=4, t=6] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=68, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=68, l={14:0}, l={15:0}, s=4, t=6] [L702] EXPR 0 \read(l) VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, t=6] [L704] 1 s++ VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=4, t=6] [L704] 1 s++ VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=4, t=6] [L704] 1 s++ VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, s++=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=4, s++=4, t=6] [L704] 1 s++ VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=5, s++=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=5, s++=4, t=6] [L702] 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={14:0}, l={15:0}, s=5, s++=4, t=6] [L704] 1 s++ VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=5, s++=4, s++=60, t=6] [L702] COND TRUE 0 s == l VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=5, s++=60, s++=4, t=6] [L704] 1 s++ VAL [\read(l)=5, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={14:0}, s=5, s++=4, s++=60, t=6] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={14:0}, l={15:0}, s=5, s++=60, t=6] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=62, l={15:0}, l={14:0}, s=5, t=6] [L703] 0 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=62, l={15:0}, s=5, t=6] [L700] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=62, l={15:0}, s=5, t=6] [L701] 1 unsigned l; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={16:0}, l={15:0}, s=5, t=6] [L703] EXPR 0 c == 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={16:0}, l={15:0}, s=5, t=6] [L702] CALL 1 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 1 t != -1 [L693] CALL 1 assume_abort_if_not(t != -1) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(t != -1) [L694] 1 *l = t [L695] EXPR 1 t + 1 [L695] 1 t = t + 1 [L702] RET 1 __VERIFIER_atomic_fetch_and_inc(&l) [L703] EXPR 0 c == 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={16:0}, s=5, t=7] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={16:0}, s=5, t=7] [L703] COND FALSE 0 !(!(c == 1)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={15:0}, l={16:0}, s=5, t=7] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={16:0}, l={15:0}, s=5, t=7] [L703] 0 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={16:0}, s=5, t=7] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=5, t=7] [L702] EXPR 1 \read(l) VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={16:0}, s=5, t=7] [L703] 0 c = 0 VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=74, l={16:0}, l={15:0}, s=5, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=74, l={15:0}, l={16:0}, s=5, t=7] [L703] 0 c = 0 VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=74, l={16:0}, l={15:0}, s=5, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=74, l={16:0}, l={15:0}, s=5, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=5, t=7] [L704] 0 s++ VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={16:0}, s=5, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={16:0}, s=5, t=7] [L704] 0 s++ VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=5, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={16:0}, s=5, t=7] [L704] 0 s++ VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=5, s++=5, t=7] [L702] COND FALSE 1 !(s == l) VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=5, s++=5, t=7] [L704] 0 s++ VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, s++=5, t=7] [L702] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, s++=5, t=7] [L704] 0 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, s++=0, s++=5, t=7] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={15:0}, l={16:0}, s=6, s++=5, s++=0, t=7] [L704] 0 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, s++=0, s++=5, t=7] [L702] 1 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, s++=5, s++=0, t=7] [L702] EXPR 1 \read(l) VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, s++=0, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={15:0}, s=6, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, s=6, t=7] [L700] COND TRUE 0 1 VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, s=6, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, s=6, t=7] [L701] 0 unsigned l; VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, t=7] [L702] 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, t=7] [L702] CALL 0 __VERIFIER_atomic_fetch_and_inc(&l) [L693] EXPR 0 t != -1 [L693] CALL 0 assume_abort_if_not(t != -1) [L4] COND FALSE 0 !(!cond) [L693] RET 0 assume_abort_if_not(t != -1) [L694] 0 *l = t [L695] EXPR 0 t + 1 [L695] 0 t = t + 1 [L702] RET 0 __VERIFIER_atomic_fetch_and_inc(&l) [L702] COND TRUE 1 s == l VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, t=8] [L702] COND TRUE 0 1 VAL [\read(l)=6, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, t=8] [L703] 1 c = 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L702] EXPR 0 \read(l) VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={16:0}, l={8:0}, s=6, t=8] [L703] 1 c = 1 VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=72, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=72, l={16:0}, l={8:0}, s=6, t=8] [L703] 1 c = 1 VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=72, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, c = 1=72, l={16:0}, l={8:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={16:0}, l={8:0}, s=6, t=8] [L703] EXPR 1 c == 1 VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L703] EXPR 1 c == 1 VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L703] COND FALSE 1 !(!(c == 1)) VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={16:0}, l={8:0}, s=6, t=8] [L702] COND FALSE 0 !(s == l) VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=1, l={8:0}, l={16:0}, s=6, t=8] [L703] 1 c = 0 VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, t=8] [L702] COND TRUE 0 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, t=8] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=51, l={16:0}, l={8:0}, s=6, t=8] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=51, l={16:0}, l={8:0}, s=6, t=8] [L703] 1 c = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=51, l={16:0}, l={8:0}, s=6, t=8] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, c = 0=51, l={8:0}, l={16:0}, s=6, t=8] [L702] EXPR 0 \read(l) VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, t=8] [L704] 1 s++ VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, t=8] [L704] 1 s++ VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, t=8] [L704] 1 s++ VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, s++=6, t=8] [L702] 0 s == l VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=6, s++=6, t=8] [L702] COND FALSE 0 !(s == l) VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=6, s++=6, t=8] [L704] 1 s++ VAL [\read(l)=7, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=7, s++=6, t=8] [L702] COND TRUE 0 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=7, s++=6, t=8] [L704] 1 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={8:0}, l={16:0}, s=7, s++=6, s++=70, t=8] [L702] 0 s == l VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=7, s++=70, s++=6, t=8] [L704] 1 s++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, c=0, l={16:0}, l={8:0}, s=7, s++=6, s++=70, t=8] Now there is a data race on ~s~0 between C: s == l [702] and C: s++ [704] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: 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 for errors in thread instance: thr1Thread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 210 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 10.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 203, 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.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 4491 NumberOfCodeBlocks, 4491 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5422 ConstructedInterpolants, 297 QuantifiedInterpolants, 33920 SizeOfPredicates, 73 NumberOfNonLiveVariables, 4465 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 5744/6506 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 17:26:51,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-04-18 17:26:51,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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