/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:29:19,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:29:19,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:29:19,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:29:19,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:29:19,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:29:19,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:29:19,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:29:19,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:29:19,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:29:19,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:29:19,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:29:19,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:29:19,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:29:19,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:29:19,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:29:19,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:29:19,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:29:19,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:29:19,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:29:19,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:29:19,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:29:19,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:29:19,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:29:19,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:29:19,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:29:19,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:29:19,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:29:19,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:29:19,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:29:19,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:29:19,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:29:19,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:29:19,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:29:19,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:29:19,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:29:19,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:29:19,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:29:19,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:29:19,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:29:19,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:29:19,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:29:19,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:29:19,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:29:19,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:29:19,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:29:19,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:29:19,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:29:19,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:29:19,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:29:19,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:29:19,707 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:29:19,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:29:19,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:29:19,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:29:19,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:29:19,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:29:19,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:29:19,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:29:19,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:29:19,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:29:19,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:29:19,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:29:19,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:29:19,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:29:19,713 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:29:19,713 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:29:19,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:29:19,713 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:29:19,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:29:19,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:29:19,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:29:19,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:29:19,924 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:29:19,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i [2022-03-15 20:29:20,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ab0587/65b66e5e0f334a26979984a6e7d5287a/FLAG370f94b2e [2022-03-15 20:29:20,463 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:29:20,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i [2022-03-15 20:29:20,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ab0587/65b66e5e0f334a26979984a6e7d5287a/FLAG370f94b2e [2022-03-15 20:29:20,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ab0587/65b66e5e0f334a26979984a6e7d5287a [2022-03-15 20:29:20,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:29:20,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:29:20,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:29:20,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:29:20,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:29:20,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:20,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131829dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20, skipping insertion in model container [2022-03-15 20:29:20,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:20,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:29:20,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:29:20,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:29:20,907 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:29:20,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:29:20,985 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:29:20,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20 WrapperNode [2022-03-15 20:29:20,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:29:20,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:29:20,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:29:20,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:29:20,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,037 INFO L137 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-03-15 20:29:21,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:29:21,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:29:21,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:29:21,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:29:21,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:29:21,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:29:21,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:29:21,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:29:21,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (1/1) ... [2022-03-15 20:29:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:29:21,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:29:21,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:29:21,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:29:21,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:29:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:29:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:29:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:29:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:29:21,117 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:29:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:29:21,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:29:21,118 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:29:21,215 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:29:21,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:29:21,342 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:29:21,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:29:21,346 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 20:29:21,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:29:21 BoogieIcfgContainer [2022-03-15 20:29:21,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:29:21,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:29:21,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:29:21,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:29:21,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:29:20" (1/3) ... [2022-03-15 20:29:21,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fa9e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:29:21, skipping insertion in model container [2022-03-15 20:29:21,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:29:20" (2/3) ... [2022-03-15 20:29:21,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fa9e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:29:21, skipping insertion in model container [2022-03-15 20:29:21,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:29:21" (3/3) ... [2022-03-15 20:29:21,371 INFO L111 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2022-03-15 20:29:21,390 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:29:21,390 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:29:21,391 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 20:29:21,391 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:29:21,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,422 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,422 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,424 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,424 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,428 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,429 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:21,431 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-03-15 20:29:21,473 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:29:21,478 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:29:21,479 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 20:29:21,488 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:29:21,494 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 120 flow [2022-03-15 20:29:21,496 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 120 flow [2022-03-15 20:29:21,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 120 flow [2022-03-15 20:29:21,539 INFO L129 PetriNetUnfolder]: 5/79 cut-off events. [2022-03-15 20:29:21,540 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-03-15 20:29:21,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 79 events. 5/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2022-03-15 20:29:21,545 INFO L116 LiptonReduction]: Number of co-enabled transitions 522 [2022-03-15 20:29:22,321 INFO L131 LiptonReduction]: Checked pairs total: 478 [2022-03-15 20:29:22,321 INFO L133 LiptonReduction]: Total number of compositions: 50 [2022-03-15 20:29:22,326 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions, 34 flow [2022-03-15 20:29:22,351 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 20:29:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 20:29:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 20:29:22,357 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:22,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 20:29:22,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2022-03-15 20:29:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash 217683, now seen corresponding path program 1 times [2022-03-15 20:29:22,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:22,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580024123] [2022-03-15 20:29:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:29:22,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:22,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580024123] [2022-03-15 20:29:22,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580024123] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:22,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:22,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:22,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965256757] [2022-03-15 20:29:22,506 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:22,507 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:22,513 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 20:29:22,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:22,514 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:22,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:22,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:22,532 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-15 20:29:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:22,551 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-03-15 20:29:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-03-15 20:29:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:22,556 INFO L225 Difference]: With dead ends: 18 [2022-03-15 20:29:22,556 INFO L226 Difference]: Without dead ends: 11 [2022-03-15 20:29:22,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:22,560 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:22,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-03-15 20:29:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-03-15 20:29:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-15 20:29:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-03-15 20:29:22,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 3 [2022-03-15 20:29:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:22,581 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-03-15 20:29:22,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-15 20:29:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-03-15 20:29:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 20:29:22,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:22,583 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-03-15 20:29:22,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:29:22,584 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2022-03-15 20:29:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:22,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2096001288, now seen corresponding path program 1 times [2022-03-15 20:29:22,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:22,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938600040] [2022-03-15 20:29:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:29:22,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:29:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:29:22,658 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:29:22,658 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:29:22,659 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-03-15 20:29:22,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2022-03-15 20:29:22,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2022-03-15 20:29:22,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2022-03-15 20:29:22,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:29:22,662 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-03-15 20:29:22,662 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-15 20:29:22,662 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:22,677 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:29:22,678 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:29:22,679 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:29:22,679 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 20:29:22,680 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:29:22,680 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 152 flow [2022-03-15 20:29:22,680 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 152 flow [2022-03-15 20:29:22,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 152 flow [2022-03-15 20:29:22,701 INFO L129 PetriNetUnfolder]: 10/144 cut-off events. [2022-03-15 20:29:22,701 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-03-15 20:29:22,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 144 events. 10/144 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 81. Up to 8 conditions per place. [2022-03-15 20:29:22,703 INFO L116 LiptonReduction]: Number of co-enabled transitions 1404 [2022-03-15 20:29:23,552 INFO L131 LiptonReduction]: Checked pairs total: 2595 [2022-03-15 20:29:23,552 INFO L133 LiptonReduction]: Total number of compositions: 49 [2022-03-15 20:29:23,553 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions, 64 flow [2022-03-15 20:29:23,574 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 313 states, 288 states have (on average 2.4965277777777777) internal successors, (719), 312 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-15 20:29:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 288 states have (on average 2.4965277777777777) internal successors, (719), 312 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-15 20:29:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 20:29:23,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:23,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 20:29:23,576 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-03-15 20:29:23,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash 344877, now seen corresponding path program 1 times [2022-03-15 20:29:23,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:23,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749820969] [2022-03-15 20:29:23,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:29:23,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:23,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749820969] [2022-03-15 20:29:23,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749820969] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:23,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:23,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:23,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453036855] [2022-03-15 20:29:23,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:23,595 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:23,595 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 20:29:23,595 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:23,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:23,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:23,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:23,597 INFO L87 Difference]: Start difference. First operand has 313 states, 288 states have (on average 2.4965277777777777) internal successors, (719), 312 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-15 20:29:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:23,632 INFO L93 Difference]: Finished difference Result 264 states and 585 transitions. [2022-03-15 20:29:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:23,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-03-15 20:29:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:23,636 INFO L225 Difference]: With dead ends: 264 [2022-03-15 20:29:23,636 INFO L226 Difference]: Without dead ends: 244 [2022-03-15 20:29:23,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:23,637 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:23,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-03-15 20:29:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2022-03-15 20:29:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 231 states have (on average 2.354978354978355) internal successors, (544), 239 states have internal predecessors, (544), 0 states have call successors, (0), 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-03-15 20:29:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 544 transitions. [2022-03-15 20:29:23,657 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 544 transitions. Word has length 3 [2022-03-15 20:29:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:23,657 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 544 transitions. [2022-03-15 20:29:23,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-15 20:29:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 544 transitions. [2022-03-15 20:29:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 20:29:23,658 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:23,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 20:29:23,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:29:23,658 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-03-15 20:29:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1696143667, now seen corresponding path program 1 times [2022-03-15 20:29:23,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:23,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650038553] [2022-03-15 20:29:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:29:23,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:23,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650038553] [2022-03-15 20:29:23,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650038553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:23,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:23,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:23,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171301184] [2022-03-15 20:29:23,681 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:23,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:23,682 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 20:29:23,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:23,683 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:23,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:23,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:23,683 INFO L87 Difference]: Start difference. First operand 240 states and 544 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-15 20:29:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:23,728 INFO L93 Difference]: Finished difference Result 247 states and 549 transitions. [2022-03-15 20:29:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-03-15 20:29:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:23,731 INFO L225 Difference]: With dead ends: 247 [2022-03-15 20:29:23,731 INFO L226 Difference]: Without dead ends: 223 [2022-03-15 20:29:23,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:23,732 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:23,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-03-15 20:29:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-03-15 20:29:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 214 states have (on average 2.336448598130841) internal successors, (500), 222 states have internal predecessors, (500), 0 states have call successors, (0), 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-03-15 20:29:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 500 transitions. [2022-03-15 20:29:23,750 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 500 transitions. Word has length 6 [2022-03-15 20:29:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:23,750 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 500 transitions. [2022-03-15 20:29:23,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-15 20:29:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 500 transitions. [2022-03-15 20:29:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:29:23,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:23,751 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:23,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:29:23,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-03-15 20:29:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1235686303, now seen corresponding path program 1 times [2022-03-15 20:29:23,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:23,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604852731] [2022-03-15 20:29:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:29:23,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:23,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604852731] [2022-03-15 20:29:23,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604852731] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:23,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:23,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:23,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404774727] [2022-03-15 20:29:23,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:23,777 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:23,777 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:29:23,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:23,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:23,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:23,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:23,779 INFO L87 Difference]: Start difference. First operand 223 states and 500 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-03-15 20:29:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:23,807 INFO L93 Difference]: Finished difference Result 207 states and 436 transitions. [2022-03-15 20:29:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:29:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:23,809 INFO L225 Difference]: With dead ends: 207 [2022-03-15 20:29:23,809 INFO L226 Difference]: Without dead ends: 186 [2022-03-15 20:29:23,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:23,810 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:23,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-03-15 20:29:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-03-15 20:29:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 2.206703910614525) internal successors, (395), 185 states have internal predecessors, (395), 0 states have call successors, (0), 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-03-15 20:29:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 395 transitions. [2022-03-15 20:29:23,818 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 395 transitions. Word has length 10 [2022-03-15 20:29:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:23,819 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 395 transitions. [2022-03-15 20:29:23,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-03-15 20:29:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 395 transitions. [2022-03-15 20:29:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:29:23,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:23,819 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-03-15 20:29:23,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:29:23,823 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-03-15 20:29:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash -351470021, now seen corresponding path program 1 times [2022-03-15 20:29:23,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:23,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292808844] [2022-03-15 20:29:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:29:23,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:29:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:29:23,859 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:29:23,859 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:29:23,859 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 5 remaining) [2022-03-15 20:29:23,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2022-03-15 20:29:23,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2022-03-15 20:29:23,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2022-03-15 20:29:23,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2022-03-15 20:29:23,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:29:23,860 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-03-15 20:29:23,860 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-15 20:29:23,860 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-03-15 20:29:23,874 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,874 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe t_funThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe t_funThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,876 WARN L322 ript$VariableManager]: TermVariabe t_funThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe t_funThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,878 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,879 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,880 WARN L322 ript$VariableManager]: TermVariabe t_funThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,881 WARN L322 ript$VariableManager]: TermVariabe t_funThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,881 WARN L322 ript$VariableManager]: TermVariabe t_funThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:29:23,887 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 20:29:23,888 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:29:23,889 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:29:23,889 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 20:29:23,890 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:29:23,890 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 78 transitions, 186 flow [2022-03-15 20:29:23,890 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 78 transitions, 186 flow [2022-03-15 20:29:23,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 186 flow [2022-03-15 20:29:23,925 INFO L129 PetriNetUnfolder]: 20/254 cut-off events. [2022-03-15 20:29:23,925 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-03-15 20:29:23,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 254 events. 20/254 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs, 1 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 152. Up to 16 conditions per place. [2022-03-15 20:29:23,929 INFO L116 LiptonReduction]: Number of co-enabled transitions 2430 [2022-03-15 20:29:24,734 INFO L131 LiptonReduction]: Checked pairs total: 5023 [2022-03-15 20:29:24,734 INFO L133 LiptonReduction]: Total number of compositions: 54 [2022-03-15 20:29:24,734 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 29 transitions, 88 flow [2022-03-15 20:29:24,772 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1793 states, 1724 states have (on average 3.1229698375870067) internal successors, (5384), 1792 states have internal predecessors, (5384), 0 states have call successors, (0), 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-03-15 20:29:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 1793 states, 1724 states have (on average 3.1229698375870067) internal successors, (5384), 1792 states have internal predecessors, (5384), 0 states have call successors, (0), 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-03-15 20:29:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 20:29:24,776 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:24,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 20:29:24,776 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-03-15 20:29:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash 486818, now seen corresponding path program 1 times [2022-03-15 20:29:24,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:24,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264987529] [2022-03-15 20:29:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:29:24,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:24,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264987529] [2022-03-15 20:29:24,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264987529] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:24,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:24,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:24,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [665864433] [2022-03-15 20:29:24,797 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:24,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:24,797 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 20:29:24,797 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:24,797 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:24,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:24,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:24,802 INFO L87 Difference]: Start difference. First operand has 1793 states, 1724 states have (on average 3.1229698375870067) internal successors, (5384), 1792 states have internal predecessors, (5384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-15 20:29:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:24,842 INFO L93 Difference]: Finished difference Result 1534 states and 4477 transitions. [2022-03-15 20:29:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-03-15 20:29:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:24,850 INFO L225 Difference]: With dead ends: 1534 [2022-03-15 20:29:24,850 INFO L226 Difference]: Without dead ends: 1488 [2022-03-15 20:29:24,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:24,851 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:24,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 17 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-03-15 20:29:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1444. [2022-03-15 20:29:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1417 states have (on average 3.0239943542695835) internal successors, (4285), 1443 states have internal predecessors, (4285), 0 states have call successors, (0), 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-03-15 20:29:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 4285 transitions. [2022-03-15 20:29:24,916 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 4285 transitions. Word has length 3 [2022-03-15 20:29:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:24,916 INFO L470 AbstractCegarLoop]: Abstraction has 1444 states and 4285 transitions. [2022-03-15 20:29:24,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-15 20:29:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 4285 transitions. [2022-03-15 20:29:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 20:29:24,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:24,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 20:29:24,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:29:24,917 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-03-15 20:29:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:24,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1633247474, now seen corresponding path program 1 times [2022-03-15 20:29:24,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:24,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366211471] [2022-03-15 20:29:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:24,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:29:24,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:24,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366211471] [2022-03-15 20:29:24,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366211471] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:24,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:24,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:24,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339369039] [2022-03-15 20:29:24,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:24,954 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:24,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 20:29:24,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:24,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:24,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:24,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:24,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:24,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:24,955 INFO L87 Difference]: Start difference. First operand 1444 states and 4285 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-15 20:29:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:25,008 INFO L93 Difference]: Finished difference Result 1618 states and 4807 transitions. [2022-03-15 20:29:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-03-15 20:29:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:25,016 INFO L225 Difference]: With dead ends: 1618 [2022-03-15 20:29:25,016 INFO L226 Difference]: Without dead ends: 1561 [2022-03-15 20:29:25,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:25,021 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:25,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-03-15 20:29:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2022-03-15 20:29:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1534 states have (on average 3.0365058670143417) internal successors, (4658), 1560 states have internal predecessors, (4658), 0 states have call successors, (0), 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-03-15 20:29:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 4658 transitions. [2022-03-15 20:29:25,054 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 4658 transitions. Word has length 6 [2022-03-15 20:29:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:25,055 INFO L470 AbstractCegarLoop]: Abstraction has 1561 states and 4658 transitions. [2022-03-15 20:29:25,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-15 20:29:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 4658 transitions. [2022-03-15 20:29:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:29:25,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:25,056 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:25,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:29:25,057 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-03-15 20:29:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:25,057 INFO L85 PathProgramCache]: Analyzing trace with hash 510211228, now seen corresponding path program 1 times [2022-03-15 20:29:25,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:25,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638911349] [2022-03-15 20:29:25,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:25,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 20:29:25,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:25,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638911349] [2022-03-15 20:29:25,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638911349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:25,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:25,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:29:25,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273589561] [2022-03-15 20:29:25,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:25,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:25,087 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:29:25,087 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:25,088 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:29:25,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:29:25,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:25,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:29:25,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:25,088 INFO L87 Difference]: Start difference. First operand 1561 states and 4658 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-03-15 20:29:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:25,138 INFO L93 Difference]: Finished difference Result 1664 states and 4897 transitions. [2022-03-15 20:29:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:29:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:29:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:25,145 INFO L225 Difference]: With dead ends: 1664 [2022-03-15 20:29:25,145 INFO L226 Difference]: Without dead ends: 1610 [2022-03-15 20:29:25,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:29:25,147 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:25,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:29:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-03-15 20:29:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2022-03-15 20:29:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1583 states have (on average 2.9955780164245103) internal successors, (4742), 1609 states have internal predecessors, (4742), 0 states have call successors, (0), 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-03-15 20:29:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 4742 transitions. [2022-03-15 20:29:25,180 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 4742 transitions. Word has length 10 [2022-03-15 20:29:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:25,180 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 4742 transitions. [2022-03-15 20:29:25,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-03-15 20:29:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 4742 transitions. [2022-03-15 20:29:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:29:25,181 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:25,181 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:25,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:29:25,181 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-03-15 20:29:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1168390389, now seen corresponding path program 1 times [2022-03-15 20:29:25,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:25,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916239492] [2022-03-15 20:29:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:29:25,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:29:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:29:25,206 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:29:25,206 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:29:25,206 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2022-03-15 20:29:25,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-03-15 20:29:25,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 20:29:25,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-03-15 20:29:25,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-03-15 20:29:25,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-03-15 20:29:25,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:29:25,207 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-03-15 20:29:25,210 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-03-15 20:29:25,210 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:29:25,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:29:25 BasicIcfg [2022-03-15 20:29:25,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:29:25,227 INFO L158 Benchmark]: Toolchain (without parser) took 4729.35ms. Allocated memory was 197.1MB in the beginning and 278.9MB in the end (delta: 81.8MB). Free memory was 144.3MB in the beginning and 158.1MB in the end (delta: -13.8MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. [2022-03-15 20:29:25,227 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory was 162.4MB in the beginning and 162.4MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:29:25,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.57ms. Allocated memory was 197.1MB in the beginning and 278.9MB in the end (delta: 81.8MB). Free memory was 144.1MB in the beginning and 239.6MB in the end (delta: -95.5MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-03-15 20:29:25,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.09ms. Allocated memory is still 278.9MB. Free memory was 239.6MB in the beginning and 237.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:29:25,227 INFO L158 Benchmark]: Boogie Preprocessor took 19.63ms. Allocated memory is still 278.9MB. Free memory was 237.0MB in the beginning and 236.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:29:25,228 INFO L158 Benchmark]: RCFGBuilder took 289.12ms. Allocated memory is still 278.9MB. Free memory was 236.0MB in the beginning and 223.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 20:29:25,228 INFO L158 Benchmark]: TraceAbstraction took 3877.56ms. Allocated memory is still 278.9MB. Free memory was 223.4MB in the beginning and 158.1MB in the end (delta: 65.3MB). Peak memory consumption was 65.3MB. Max. memory is 8.0GB. [2022-03-15 20:29:25,229 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.12ms. Allocated memory is still 197.1MB. Free memory was 162.4MB in the beginning and 162.4MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.57ms. Allocated memory was 197.1MB in the beginning and 278.9MB in the end (delta: 81.8MB). Free memory was 144.1MB in the beginning and 239.6MB in the end (delta: -95.5MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.09ms. Allocated memory is still 278.9MB. Free memory was 239.6MB in the beginning and 237.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.63ms. Allocated memory is still 278.9MB. Free memory was 237.0MB in the beginning and 236.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 289.12ms. Allocated memory is still 278.9MB. Free memory was 236.0MB in the beginning and 223.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3877.56ms. Allocated memory is still 278.9MB. Free memory was 223.4MB in the beginning and 158.1MB in the end (delta: 65.3MB). Peak memory consumption was 65.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 56 PlacesBefore, 15 PlacesAfterwards, 56 TransitionsBefore, 13 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 4 FixpointIterations, 14 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 50 TotalNumberOfCompositions, 478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 478, positive: 478, positive conditional: 0, positive unconditional: 478, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 277, positive: 277, positive conditional: 0, positive unconditional: 277, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 478, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 277, unknown conditional: 0, unknown unconditional: 277] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 68 PlacesBefore, 26 PlacesAfterwards, 67 TransitionsBefore, 23 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 49 TotalNumberOfCompositions, 2595 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1634, positive: 1565, positive conditional: 0, positive unconditional: 1565, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 721, positive: 709, positive conditional: 0, positive unconditional: 709, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1634, positive: 856, positive conditional: 0, positive unconditional: 856, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 721, unknown conditional: 0, unknown unconditional: 721] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 80 PlacesBefore, 33 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 2430 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 54 TotalNumberOfCompositions, 5023 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2821, positive: 2727, positive conditional: 0, positive unconditional: 2727, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1219, positive: 1196, positive conditional: 0, positive unconditional: 1196, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2821, positive: 1531, positive conditional: 0, positive unconditional: 1531, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 1219, unknown conditional: 0, unknown unconditional: 1219] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - 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: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; [L923] 0 pthread_t id[10]; [L924] 0 int i; [L925] 0 i=0 VAL [i=0, id={2:0}, myglobal=0] [L925] COND TRUE 0 i<10 [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, i=0, id={2:0}, myglobal=0, pthread_create(&id[i], ((void *)0), t_fun, ((void *)0))=-2] [L919] 1 myglobal=42 VAL [arg={0:0}, arg={0:0}, myglobal=42, myglobal=42=43] [L925] 0 i++ VAL [arg={0:0}, arg={0:0}, i=1, id={2:0}, myglobal=42, myglobal=42=43] [L925] COND TRUE 0 i<10 [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=1, id={2:0}, myglobal=42, myglobal=42=43, pthread_create(&id[i], ((void *)0), t_fun, ((void *)0))=-1] [L919] 2 myglobal=42 VAL [arg={0:0}, arg={0:0}, myglobal=42, myglobal=42=44] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 64 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 74 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 21 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 84 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 30 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1793occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 44 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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-03-15 20:29:25,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...