/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/09-regions_11-arraylist_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:15:59,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:15:59,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:15:59,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:15:59,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:15:59,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:15:59,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:15:59,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:15:59,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:15:59,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:15:59,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:16:00,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:16:00,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:16:00,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:16:00,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:16:00,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:16:00,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:16:00,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:16:00,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:16:00,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:16:00,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:16:00,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:16:00,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:16:00,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:16:00,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:16:00,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:16:00,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:16:00,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:16:00,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:16:00,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:16:00,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:16:00,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:16:00,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:16:00,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:16:00,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:16:00,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:16:00,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:16:00,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:16:00,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:16:00,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:16:00,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:16:00,031 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:16:00,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:16:00,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:16:00,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:16:00,056 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:16:00,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:16:00,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:16:00,056 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:16:00,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:16:00,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:16:00,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:16:00,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:16:00,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:16:00,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:16:00,058 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:16:00,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:16:00,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:16:00,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:16:00,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:16:00,295 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:16:00,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i [2022-03-15 20:16:00,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52149fc21/486274f29e6c4764ba4d473c4d8734c8/FLAG45c1105ed [2022-03-15 20:16:00,779 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:16:00,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i [2022-03-15 20:16:00,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52149fc21/486274f29e6c4764ba4d473c4d8734c8/FLAG45c1105ed [2022-03-15 20:16:00,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52149fc21/486274f29e6c4764ba4d473c4d8734c8 [2022-03-15 20:16:00,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:16:00,824 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:16:00,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:16:00,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:16:00,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:16:00,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:16:00" (1/1) ... [2022-03-15 20:16:00,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175b840e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:00, skipping insertion in model container [2022-03-15 20:16:00,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:16:00" (1/1) ... [2022-03-15 20:16:00,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:16:00,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:16:01,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:16:01,233 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:16:01,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:16:01,332 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:16:01,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01 WrapperNode [2022-03-15 20:16:01,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:16:01,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:16:01,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:16:01,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:16:01,340 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:16:01" (1/1) ... [2022-03-15 20:16:01,369 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:16:01" (1/1) ... [2022-03-15 20:16:01,410 INFO L137 Inliner]: procedures = 371, calls = 35, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 233 [2022-03-15 20:16:01,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:16:01,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:16:01,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:16:01,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:16:01,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:16:01,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:16:01,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:16:01,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:16:01,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (1/1) ... [2022-03-15 20:16:01,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:16:01,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:01,513 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:16:01,527 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:16:01,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:16:01,543 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:16:01,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:16:01,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:16:01,544 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:16:01,671 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:16:01,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:16:02,072 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:16:02,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:16:02,085 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-15 20:16:02,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:16:02 BoogieIcfgContainer [2022-03-15 20:16:02,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:16:02,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:16:02,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:16:02,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:16:02,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:16:00" (1/3) ... [2022-03-15 20:16:02,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179bd1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:16:02, skipping insertion in model container [2022-03-15 20:16:02,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:16:01" (2/3) ... [2022-03-15 20:16:02,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179bd1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:16:02, skipping insertion in model container [2022-03-15 20:16:02,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:16:02" (3/3) ... [2022-03-15 20:16:02,095 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2022-03-15 20:16:02,099 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:16:02,099 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:16:02,099 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-15 20:16:02,099 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:16:02,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,162 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,163 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,164 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,220 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,223 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,224 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:16:02,226 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:16:02,255 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:16:02,260 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:16:02,260 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-15 20:16:02,275 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:16:02,283 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 280 transitions, 565 flow [2022-03-15 20:16:02,289 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 280 transitions, 565 flow [2022-03-15 20:16:02,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 280 places, 280 transitions, 565 flow [2022-03-15 20:16:02,374 INFO L129 PetriNetUnfolder]: 4/279 cut-off events. [2022-03-15 20:16:02,374 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:16:02,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 279 events. 4/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-03-15 20:16:02,389 INFO L116 LiptonReduction]: Number of co-enabled transitions 6512 [2022-03-15 20:16:48,399 WARN L228 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:16,907 WARN L228 SmtUtils]: Spent 25.30s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:33,523 WARN L228 SmtUtils]: Spent 16.61s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:18:03,120 WARN L228 SmtUtils]: Spent 29.59s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:18:31,989 WARN L228 SmtUtils]: Spent 28.87s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:19:44,858 WARN L228 SmtUtils]: Spent 1.21m on a formula simplification that was a NOOP. DAG size: 322 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:20:46,572 WARN L228 SmtUtils]: Spent 1.03m on a formula simplification that was a NOOP. DAG size: 295 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:12,566 WARN L228 SmtUtils]: Spent 1.43m on a formula simplification that was a NOOP. DAG size: 328 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:23:22,531 WARN L228 SmtUtils]: Spent 1.17m on a formula simplification that was a NOOP. DAG size: 301 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:23:22,539 INFO L131 LiptonReduction]: Checked pairs total: 45212 [2022-03-15 20:23:22,540 INFO L133 LiptonReduction]: Total number of compositions: 259 [2022-03-15 20:23:22,551 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 81 transitions, 167 flow [2022-03-15 20:23:22,612 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1106 states, 1070 states have (on average 1.9925233644859812) internal successors, (2132), 1105 states have internal predecessors, (2132), 0 states have call successors, (0), 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:23:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 1070 states have (on average 1.9925233644859812) internal successors, (2132), 1105 states have internal predecessors, (2132), 0 states have call successors, (0), 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:23:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-03-15 20:23:22,622 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:22,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1] [2022-03-15 20:23:22,622 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash 29479, now seen corresponding path program 1 times [2022-03-15 20:23:22,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:22,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201178944] [2022-03-15 20:23:22,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:22,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:22,742 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:23:22,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:22,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201178944] [2022-03-15 20:23:22,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201178944] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:22,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:22,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:23:22,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901558523] [2022-03-15 20:23:22,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:22,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:22,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 3 states and 2 transitions. [2022-03-15 20:23:22,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:22,754 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:22,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:23:22,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:23:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:23:22,771 INFO L87 Difference]: Start difference. First operand has 1106 states, 1070 states have (on average 1.9925233644859812) internal successors, (2132), 1105 states have internal predecessors, (2132), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:23:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:23,136 INFO L93 Difference]: Finished difference Result 1097 states and 2123 transitions. [2022-03-15 20:23:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:23:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-03-15 20:23:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:23,162 INFO L225 Difference]: With dead ends: 1097 [2022-03-15 20:23:23,162 INFO L226 Difference]: Without dead ends: 1097 [2022-03-15 20:23:23,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:23:23,168 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:23,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:23:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-03-15 20:23:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2022-03-15 20:23:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1070 states have (on average 1.9841121495327103) internal successors, (2123), 1096 states have internal predecessors, (2123), 0 states have call successors, (0), 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:23:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2123 transitions. [2022-03-15 20:23:23,234 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 2123 transitions. Word has length 2 [2022-03-15 20:23:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:23,235 INFO L470 AbstractCegarLoop]: Abstraction has 1097 states and 2123 transitions. [2022-03-15 20:23:23,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:23:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 2123 transitions. [2022-03-15 20:23:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:23:23,235 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:23,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:23,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:23:23,236 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1020195478, now seen corresponding path program 1 times [2022-03-15 20:23:23,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:23,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196216153] [2022-03-15 20:23:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:23,494 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:23:23,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:23,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196216153] [2022-03-15 20:23:23,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196216153] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:23,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:23,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:23:23,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871677221] [2022-03-15 20:23:23,495 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:23,496 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:23,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:23:23,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:23,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:23,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:23:23,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:23:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:23:23,500 INFO L87 Difference]: Start difference. First operand 1097 states and 2123 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:23:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:24,629 INFO L93 Difference]: Finished difference Result 1098 states and 2124 transitions. [2022-03-15 20:23:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:23:24,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:23:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:24,633 INFO L225 Difference]: With dead ends: 1098 [2022-03-15 20:23:24,633 INFO L226 Difference]: Without dead ends: 1098 [2022-03-15 20:23:24,634 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:23:24,634 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:24,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:23:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2022-03-15 20:23:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2022-03-15 20:23:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1071 states have (on average 1.9831932773109244) internal successors, (2124), 1097 states have internal predecessors, (2124), 0 states have call successors, (0), 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:23:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 2124 transitions. [2022-03-15 20:23:24,666 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 2124 transitions. Word has length 10 [2022-03-15 20:23:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:24,666 INFO L470 AbstractCegarLoop]: Abstraction has 1098 states and 2124 transitions. [2022-03-15 20:23:24,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:23:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 2124 transitions. [2022-03-15 20:23:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:23:24,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:24,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:24,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:23:24,667 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash -324607759, now seen corresponding path program 1 times [2022-03-15 20:23:24,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:24,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873383249] [2022-03-15 20:23:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:24,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:24,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873383249] [2022-03-15 20:23:24,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873383249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:24,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823723349] [2022-03-15 20:23:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:24,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:24,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:23:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:25,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:23:25,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:25,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:25,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823723349] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:25,216 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:25,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 20:23:25,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305168119] [2022-03-15 20:23:25,216 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:25,217 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:25,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:23:25,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:25,218 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:25,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:23:25,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:23:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:23:25,219 INFO L87 Difference]: Start difference. First operand 1098 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:23:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:27,024 INFO L93 Difference]: Finished difference Result 1099 states and 2125 transitions. [2022-03-15 20:23:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:23:27,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 20:23:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:27,028 INFO L225 Difference]: With dead ends: 1099 [2022-03-15 20:23:27,028 INFO L226 Difference]: Without dead ends: 1099 [2022-03-15 20:23:27,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:23:27,029 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:27,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:23:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-03-15 20:23:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2022-03-15 20:23:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1072 states have (on average 1.982276119402985) internal successors, (2125), 1098 states have internal predecessors, (2125), 0 states have call successors, (0), 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:23:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2125 transitions. [2022-03-15 20:23:27,064 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2125 transitions. Word has length 11 [2022-03-15 20:23:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:27,065 INFO L470 AbstractCegarLoop]: Abstraction has 1099 states and 2125 transitions. [2022-03-15 20:23:27,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:23:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2125 transitions. [2022-03-15 20:23:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:23:27,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:27,065 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:27,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 20:23:27,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:27,267 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash 936164854, now seen corresponding path program 2 times [2022-03-15 20:23:27,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:27,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070976822] [2022-03-15 20:23:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:27,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:27,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070976822] [2022-03-15 20:23:27,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070976822] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:27,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018022698] [2022-03-15 20:23:27,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:23:27,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:27,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:27,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:27,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 20:23:27,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:23:27,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:27,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:23:27,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:27,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:23:27,909 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:23:27,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:23:27,940 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:23:27,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:23:27,995 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:23:27,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:23:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:23:28,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:28,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018022698] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:28,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:28,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2022-03-15 20:23:28,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449925785] [2022-03-15 20:23:28,016 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:28,018 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:28,019 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 20:23:28,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:28,020 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:28,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:23:28,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:23:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:23:28,021 INFO L87 Difference]: Start difference. First operand 1099 states and 2125 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:23:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:29,700 INFO L93 Difference]: Finished difference Result 1929 states and 3724 transitions. [2022-03-15 20:23:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:23:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 12 [2022-03-15 20:23:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:29,707 INFO L225 Difference]: With dead ends: 1929 [2022-03-15 20:23:29,707 INFO L226 Difference]: Without dead ends: 1929 [2022-03-15 20:23:29,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:23:29,707 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 85 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:29,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 46 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:23:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-03-15 20:23:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1255. [2022-03-15 20:23:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1228 states have (on average 1.981270358306189) internal successors, (2433), 1254 states have internal predecessors, (2433), 0 states have call successors, (0), 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:23:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2433 transitions. [2022-03-15 20:23:29,732 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2433 transitions. Word has length 12 [2022-03-15 20:23:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:29,732 INFO L470 AbstractCegarLoop]: Abstraction has 1255 states and 2433 transitions. [2022-03-15 20:23:29,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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:23:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2433 transitions. [2022-03-15 20:23:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:23:29,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:29,754 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:29,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:29,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 20:23:29,963 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 399411081, now seen corresponding path program 1 times [2022-03-15 20:23:29,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:29,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988217125] [2022-03-15 20:23:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:30,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:30,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988217125] [2022-03-15 20:23:30,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988217125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:30,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134798999] [2022-03-15 20:23:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:30,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:30,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:30,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:30,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 20:23:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:30,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:23:30,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:30,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:30,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134798999] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:30,538 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:30,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 20:23:30,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1236671110] [2022-03-15 20:23:30,538 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:30,540 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:30,541 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:23:30,541 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:30,541 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:30,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:23:30,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:23:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:23:30,542 INFO L87 Difference]: Start difference. First operand 1255 states and 2433 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:23:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:32,050 INFO L93 Difference]: Finished difference Result 1256 states and 2434 transitions. [2022-03-15 20:23:32,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:23:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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) Word has length 13 [2022-03-15 20:23:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:32,054 INFO L225 Difference]: With dead ends: 1256 [2022-03-15 20:23:32,054 INFO L226 Difference]: Without dead ends: 1256 [2022-03-15 20:23:32,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:23:32,055 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:32,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:23:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2022-03-15 20:23:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2022-03-15 20:23:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1229 states have (on average 1.9804719283970709) internal successors, (2434), 1255 states have internal predecessors, (2434), 0 states have call successors, (0), 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:23:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2434 transitions. [2022-03-15 20:23:32,074 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2434 transitions. Word has length 13 [2022-03-15 20:23:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:32,074 INFO L470 AbstractCegarLoop]: Abstraction has 1256 states and 2434 transitions. [2022-03-15 20:23:32,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:23:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2434 transitions. [2022-03-15 20:23:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:23:32,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:32,075 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:32,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:32,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:32,294 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 821114702, now seen corresponding path program 2 times [2022-03-15 20:23:32,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:32,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206001368] [2022-03-15 20:23:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:23:32,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:32,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206001368] [2022-03-15 20:23:32,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206001368] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:32,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:32,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:23:32,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674580325] [2022-03-15 20:23:32,481 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:32,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:32,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2022-03-15 20:23:32,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:32,485 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:32,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:23:32,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:32,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:23:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:23:32,486 INFO L87 Difference]: Start difference. First operand 1256 states and 2434 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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:23:35,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:23:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:35,253 INFO L93 Difference]: Finished difference Result 1340 states and 2598 transitions. [2022-03-15 20:23:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:23:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 14 [2022-03-15 20:23:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:35,259 INFO L225 Difference]: With dead ends: 1340 [2022-03-15 20:23:35,259 INFO L226 Difference]: Without dead ends: 1340 [2022-03-15 20:23:35,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:23:35,260 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:35,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:23:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-03-15 20:23:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2022-03-15 20:23:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1313 states have (on average 1.9786747905559787) internal successors, (2598), 1339 states have internal predecessors, (2598), 0 states have call successors, (0), 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:23:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2598 transitions. [2022-03-15 20:23:35,281 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2598 transitions. Word has length 14 [2022-03-15 20:23:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:35,281 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 2598 transitions. [2022-03-15 20:23:35,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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:23:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2598 transitions. [2022-03-15 20:23:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:23:35,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:35,282 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:35,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:23:35,282 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:35,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:35,282 INFO L85 PathProgramCache]: Analyzing trace with hash 169751905, now seen corresponding path program 1 times [2022-03-15 20:23:35,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:35,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054750975] [2022-03-15 20:23:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:35,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:35,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054750975] [2022-03-15 20:23:35,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054750975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:35,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121266691] [2022-03-15 20:23:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:35,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:35,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 20:23:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:35,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:23:35,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:35,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:35,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121266691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:35,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:35,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 20:23:35,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498491743] [2022-03-15 20:23:35,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:35,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:35,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 45 transitions. [2022-03-15 20:23:35,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:36,053 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:36,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:23:36,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:23:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:23:36,054 INFO L87 Difference]: Start difference. First operand 1340 states and 2598 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:23:38,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:23:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:38,109 INFO L93 Difference]: Finished difference Result 1341 states and 2599 transitions. [2022-03-15 20:23:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:23:38,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-03-15 20:23:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:38,113 INFO L225 Difference]: With dead ends: 1341 [2022-03-15 20:23:38,113 INFO L226 Difference]: Without dead ends: 1341 [2022-03-15 20:23:38,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:23:38,114 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:38,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:23:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-03-15 20:23:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2022-03-15 20:23:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1314 states have (on average 1.9779299847793) internal successors, (2599), 1340 states have internal predecessors, (2599), 0 states have call successors, (0), 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:23:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2599 transitions. [2022-03-15 20:23:38,133 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2599 transitions. Word has length 17 [2022-03-15 20:23:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:38,133 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 2599 transitions. [2022-03-15 20:23:38,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:23:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2599 transitions. [2022-03-15 20:23:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:23:38,134 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:38,134 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:38,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:38,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:38,354 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1864989350, now seen corresponding path program 2 times [2022-03-15 20:23:38,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:38,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405318470] [2022-03-15 20:23:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:38,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:38,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405318470] [2022-03-15 20:23:38,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405318470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:38,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568280096] [2022-03-15 20:23:38,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:23:38,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:38,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:38,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:38,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 20:23:39,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:23:39,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:39,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 20:23:39,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:39,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:39,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:39,191 INFO L353 Elim1Store]: treesize reduction 105, result has 21.1 percent of original size [2022-03-15 20:23:39,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 53 [2022-03-15 20:23:39,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:23:39,422 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:23:39,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:23:39,519 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:23:39,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:23:39,614 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:23:39,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:23:39,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:39,773 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-03-15 20:23:39,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-03-15 20:23:39,843 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:23:39,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:23:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:23:39,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:39,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568280096] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:39,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:39,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 14 [2022-03-15 20:23:39,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290005284] [2022-03-15 20:23:39,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:39,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:39,877 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 20:23:39,877 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:39,972 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:39,973 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:39,976 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:39,977 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:40,061 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:40,062 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:40,064 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:40,064 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:40,138 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:40,138 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:40,140 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:40,141 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:40,598 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [29002#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 29003#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 29004#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 29001#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:23:40,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:23:40,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:23:40,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:23:40,599 INFO L87 Difference]: Start difference. First operand 1341 states and 2599 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:23:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:41,742 INFO L93 Difference]: Finished difference Result 1421 states and 2757 transitions. [2022-03-15 20:23:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:23:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 18 [2022-03-15 20:23:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:41,746 INFO L225 Difference]: With dead ends: 1421 [2022-03-15 20:23:41,746 INFO L226 Difference]: Without dead ends: 1421 [2022-03-15 20:23:41,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:23:41,747 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:41,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 203 Invalid, 0 Unknown, 53 Unchecked, 1.1s Time] [2022-03-15 20:23:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2022-03-15 20:23:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1345. [2022-03-15 20:23:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1318 states have (on average 1.9779969650986342) internal successors, (2607), 1344 states have internal predecessors, (2607), 0 states have call successors, (0), 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:23:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2607 transitions. [2022-03-15 20:23:41,766 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2607 transitions. Word has length 18 [2022-03-15 20:23:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:41,766 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 2607 transitions. [2022-03-15 20:23:41,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:23:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2607 transitions. [2022-03-15 20:23:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:23:41,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:41,767 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:41,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:41,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:41,983 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash 863611652, now seen corresponding path program 3 times [2022-03-15 20:23:41,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:41,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141071096] [2022-03-15 20:23:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:42,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:42,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141071096] [2022-03-15 20:23:42,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141071096] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:42,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868610504] [2022-03-15 20:23:42,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:23:42,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:42,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:42,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 20:23:42,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:23:42,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:42,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 20:23:42,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:42,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:42,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:42,804 INFO L353 Elim1Store]: treesize reduction 81, result has 19.8 percent of original size [2022-03-15 20:23:42,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2022-03-15 20:23:42,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:23:42,997 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:23:42,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:23:43,059 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:23:43,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:23:43,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:43,151 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:23:43,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 20:23:43,219 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:23:43,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:23:43,258 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:23:43,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:23:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:23:43,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:43,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868610504] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:43,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:43,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 14 [2022-03-15 20:23:43,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207835271] [2022-03-15 20:23:43,285 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:43,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:43,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 20:23:43,292 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:43,349 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:43,350 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:43,353 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:43,353 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:43,565 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:43,565 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:43,567 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:43,567 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:43,700 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:43,701 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:43,703 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:43,704 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:43,935 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [33182#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 33184#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 33183#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:23:43,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:23:43,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:23:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:23:43,936 INFO L87 Difference]: Start difference. First operand 1345 states and 2607 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:23:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:45,975 INFO L93 Difference]: Finished difference Result 2455 states and 4730 transitions. [2022-03-15 20:23:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:23:45,975 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 18 [2022-03-15 20:23:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:45,982 INFO L225 Difference]: With dead ends: 2455 [2022-03-15 20:23:45,982 INFO L226 Difference]: Without dead ends: 2455 [2022-03-15 20:23:45,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:23:45,983 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 99 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:45,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 410 Invalid, 0 Unknown, 279 Unchecked, 2.0s Time] [2022-03-15 20:23:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-03-15 20:23:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 1372. [2022-03-15 20:23:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1345 states have (on average 1.979182156133829) internal successors, (2662), 1371 states have internal predecessors, (2662), 0 states have call successors, (0), 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:23:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2662 transitions. [2022-03-15 20:23:46,006 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2662 transitions. Word has length 18 [2022-03-15 20:23:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:46,006 INFO L470 AbstractCegarLoop]: Abstraction has 1372 states and 2662 transitions. [2022-03-15 20:23:46,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:23:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2662 transitions. [2022-03-15 20:23:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:23:46,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:46,006 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:46,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:46,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:46,227 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 533335172, now seen corresponding path program 4 times [2022-03-15 20:23:46,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:46,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739798091] [2022-03-15 20:23:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:46,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:46,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739798091] [2022-03-15 20:23:46,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739798091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:46,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163248008] [2022-03-15 20:23:46,408 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:23:46,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:46,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:46,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:46,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 20:23:50,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:23:50,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:50,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:23:50,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:50,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:50,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163248008] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:50,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:50,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 20:23:50,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285448977] [2022-03-15 20:23:50,740 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:50,742 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:50,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 20:23:50,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:50,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:50,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:23:50,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:23:50,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:50,809 INFO L87 Difference]: Start difference. First operand 1372 states and 2662 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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:23:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:52,702 INFO L93 Difference]: Finished difference Result 1373 states and 2663 transitions. [2022-03-15 20:23:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:23:52,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-03-15 20:23:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:52,706 INFO L225 Difference]: With dead ends: 1373 [2022-03-15 20:23:52,706 INFO L226 Difference]: Without dead ends: 1373 [2022-03-15 20:23:52,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:52,707 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:52,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:23:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-03-15 20:23:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2022-03-15 20:23:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1346 states have (on average 1.9784546805349184) internal successors, (2663), 1372 states have internal predecessors, (2663), 0 states have call successors, (0), 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:23:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2663 transitions. [2022-03-15 20:23:52,723 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2663 transitions. Word has length 18 [2022-03-15 20:23:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:52,724 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 2663 transitions. [2022-03-15 20:23:52,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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:23:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2663 transitions. [2022-03-15 20:23:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:23:52,724 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:52,724 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:52,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:52,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:52,946 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:52,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1546088415, now seen corresponding path program 5 times [2022-03-15 20:23:52,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:52,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600869989] [2022-03-15 20:23:52,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:53,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:53,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600869989] [2022-03-15 20:23:53,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600869989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:53,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723432163] [2022-03-15 20:23:53,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:23:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:53,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:53,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 20:23:53,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:23:53,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:53,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:23:53,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:53,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:53,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723432163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:53,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:53,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 20:23:53,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111742993] [2022-03-15 20:23:53,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:53,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:53,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 47 transitions. [2022-03-15 20:23:53,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:53,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:53,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:23:53,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:23:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:53,971 INFO L87 Difference]: Start difference. First operand 1373 states and 2663 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:23:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:55,562 INFO L93 Difference]: Finished difference Result 1374 states and 2664 transitions. [2022-03-15 20:23:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:23:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-03-15 20:23:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:55,566 INFO L225 Difference]: With dead ends: 1374 [2022-03-15 20:23:55,567 INFO L226 Difference]: Without dead ends: 1374 [2022-03-15 20:23:55,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:55,569 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:55,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:23:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-03-15 20:23:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2022-03-15 20:23:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1347 states have (on average 1.977728285077951) internal successors, (2664), 1373 states have internal predecessors, (2664), 0 states have call successors, (0), 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:23:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2664 transitions. [2022-03-15 20:23:55,587 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2664 transitions. Word has length 19 [2022-03-15 20:23:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:55,587 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 2664 transitions. [2022-03-15 20:23:55,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:23:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2664 transitions. [2022-03-15 20:23:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:23:55,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:55,588 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:55,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 20:23:55,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 20:23:55,803 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1418299420, now seen corresponding path program 6 times [2022-03-15 20:23:55,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:55,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315153339] [2022-03-15 20:23:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:55,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:55,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315153339] [2022-03-15 20:23:55,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315153339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:55,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469034010] [2022-03-15 20:23:55,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:23:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:55,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:55,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 20:23:56,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 20:23:56,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:56,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:23:56,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:56,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:56,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:56,724 INFO L353 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-03-15 20:23:56,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 42 [2022-03-15 20:23:56,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:23:56,809 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:23:56,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:23:56,875 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:23:56,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:23:56,942 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:23:56,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:23:56,988 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 20:23:56,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:23:57,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-03-15 20:23:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 20:23:57,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:57,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469034010] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:57,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:57,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2022-03-15 20:23:57,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979616881] [2022-03-15 20:23:57,059 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:57,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:57,067 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:23:57,067 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:57,173 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:57,174 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:57,177 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:57,178 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:57,207 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:57,208 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:57,210 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:57,211 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:57,334 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:57,334 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:57,337 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:57,337 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:57,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [46938#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 46940#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|)), 46939#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 46937#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:23:57,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:23:57,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:57,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:23:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:23:57,541 INFO L87 Difference]: Start difference. First operand 1374 states and 2664 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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:23:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:58,818 INFO L93 Difference]: Finished difference Result 1525 states and 2962 transitions. [2022-03-15 20:23:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:23:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 20 [2022-03-15 20:23:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:58,823 INFO L225 Difference]: With dead ends: 1525 [2022-03-15 20:23:58,823 INFO L226 Difference]: Without dead ends: 1525 [2022-03-15 20:23:58,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:23:58,825 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:58,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 339 Invalid, 0 Unknown, 100 Unchecked, 1.3s Time] [2022-03-15 20:23:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-03-15 20:23:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1375. [2022-03-15 20:23:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1348 states have (on average 1.9777448071216617) internal successors, (2666), 1374 states have internal predecessors, (2666), 0 states have call successors, (0), 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:23:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2666 transitions. [2022-03-15 20:23:58,844 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2666 transitions. Word has length 20 [2022-03-15 20:23:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:58,844 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 2666 transitions. [2022-03-15 20:23:58,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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:23:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2666 transitions. [2022-03-15 20:23:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:23:58,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:58,844 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:58,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:59,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:59,066 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1353949736, now seen corresponding path program 7 times [2022-03-15 20:23:59,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:59,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311628814] [2022-03-15 20:23:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:59,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:59,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311628814] [2022-03-15 20:23:59,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311628814] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:59,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648165744] [2022-03-15 20:23:59,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:23:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:59,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:59,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 20:23:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:59,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:23:59,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:00,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:24:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:00,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648165744] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:24:00,075 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:24:00,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 20:24:00,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [375381361] [2022-03-15 20:24:00,075 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:00,078 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:00,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:24:00,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:00,101 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:00,102 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:00,130 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:00,130 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:00,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:00,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:24:00,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:24:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:00,184 INFO L87 Difference]: Start difference. First operand 1375 states and 2666 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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:24:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:01,710 INFO L93 Difference]: Finished difference Result 1376 states and 2667 transitions. [2022-03-15 20:24:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:24:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-03-15 20:24:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:01,714 INFO L225 Difference]: With dead ends: 1376 [2022-03-15 20:24:01,714 INFO L226 Difference]: Without dead ends: 1376 [2022-03-15 20:24:01,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:01,715 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:01,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:24:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-03-15 20:24:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2022-03-15 20:24:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1349 states have (on average 1.9770200148257968) internal successors, (2667), 1375 states have internal predecessors, (2667), 0 states have call successors, (0), 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:24:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2667 transitions. [2022-03-15 20:24:01,794 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2667 transitions. Word has length 20 [2022-03-15 20:24:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:01,794 INFO L470 AbstractCegarLoop]: Abstraction has 1376 states and 2667 transitions. [2022-03-15 20:24:01,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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:24:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2667 transitions. [2022-03-15 20:24:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:24:01,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:01,795 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:01,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:24:02,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 20:24:02,016 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1239307891, now seen corresponding path program 8 times [2022-03-15 20:24:02,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:02,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400672821] [2022-03-15 20:24:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:02,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:02,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400672821] [2022-03-15 20:24:02,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400672821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:24:02,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178007930] [2022-03-15 20:24:02,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:24:02,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:02,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:24:02,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:24:02,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 20:24:03,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:24:03,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:24:03,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 20:24:03,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:03,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,219 INFO L353 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-03-15 20:24:03,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 42 [2022-03-15 20:24:03,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:24:03,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:24:03,427 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 20:24:03,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:24:03,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:24:03,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:24:03,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:03,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:24:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 20:24:03,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:24:03,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178007930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:03,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:24:03,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-03-15 20:24:03,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2133684981] [2022-03-15 20:24:03,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:03,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:03,641 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 20:24:03,641 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:03,650 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:03,651 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:03,654 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:03,654 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:03,712 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:03,713 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:03,714 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:03,715 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,081 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,082 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,084 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,085 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,367 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [55551#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (<= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 3 |~#slot~0.base|) (<= 0 |~#slot~0.offset|) (< |ULTIMATE.start_main_~j~0#1| 10)), 55550#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (<= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 3 |~#slot~0.base|) (<= 0 |~#slot~0.offset|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (< |ULTIMATE.start_main_~j~0#1| 10))] [2022-03-15 20:24:04,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:24:04,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:24:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:24:04,368 INFO L87 Difference]: Start difference. First operand 1376 states and 2667 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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:24:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:05,746 INFO L93 Difference]: Finished difference Result 2532 states and 4881 transitions. [2022-03-15 20:24:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:24:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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 21 [2022-03-15 20:24:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:05,754 INFO L225 Difference]: With dead ends: 2532 [2022-03-15 20:24:05,754 INFO L226 Difference]: Without dead ends: 2532 [2022-03-15 20:24:05,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:24:05,754 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 96 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:05,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 178 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 697 Invalid, 0 Unknown, 344 Unchecked, 1.3s Time] [2022-03-15 20:24:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2022-03-15 20:24:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1392. [2022-03-15 20:24:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1365 states have (on average 1.978021978021978) internal successors, (2700), 1391 states have internal predecessors, (2700), 0 states have call successors, (0), 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:24:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2700 transitions. [2022-03-15 20:24:05,779 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2700 transitions. Word has length 21 [2022-03-15 20:24:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:05,780 INFO L470 AbstractCegarLoop]: Abstraction has 1392 states and 2700 transitions. [2022-03-15 20:24:05,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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:24:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2700 transitions. [2022-03-15 20:24:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:24:05,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:05,780 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:05,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 20:24:05,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:24:05,981 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1124312397, now seen corresponding path program 9 times [2022-03-15 20:24:05,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:05,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233696496] [2022-03-15 20:24:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:06,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:06,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233696496] [2022-03-15 20:24:06,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233696496] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:24:06,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253232268] [2022-03-15 20:24:06,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:24:06,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:24:06,168 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:24:06,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:24:07,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:24:07,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:24:07,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 20:24:07,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:07,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:07,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:07,184 INFO L353 Elim1Store]: treesize reduction 105, result has 21.1 percent of original size [2022-03-15 20:24:07,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 53 [2022-03-15 20:24:07,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:24:07,371 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:24:07,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:24:07,514 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:24:07,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:24:07,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:07,572 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-03-15 20:24:07,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-03-15 20:24:07,640 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:24:07,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:24:07,698 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:24:07,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:24:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 20:24:07,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:24:07,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253232268] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:07,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:24:07,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-03-15 20:24:07,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739399855] [2022-03-15 20:24:07,718 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:07,721 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:07,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 20:24:07,727 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:07,797 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:07,797 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:07,799 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:07,799 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:07,867 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:07,869 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:07,871 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:07,872 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:07,917 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:07,918 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:07,934 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:07,935 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:08,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [60949#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 60950#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 60948#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:24:08,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:24:08,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:24:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:24:08,342 INFO L87 Difference]: Start difference. First operand 1392 states and 2700 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:24:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:09,508 INFO L93 Difference]: Finished difference Result 2608 states and 5033 transitions. [2022-03-15 20:24:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:24:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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 21 [2022-03-15 20:24:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:09,513 INFO L225 Difference]: With dead ends: 2608 [2022-03-15 20:24:09,513 INFO L226 Difference]: Without dead ends: 2608 [2022-03-15 20:24:09,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:24:09,514 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 136 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:09,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 132 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 572 Invalid, 0 Unknown, 207 Unchecked, 1.1s Time] [2022-03-15 20:24:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2022-03-15 20:24:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 1393. [2022-03-15 20:24:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1366 states have (on average 1.9780380673499267) internal successors, (2702), 1392 states have internal predecessors, (2702), 0 states have call successors, (0), 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:24:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2702 transitions. [2022-03-15 20:24:09,540 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2702 transitions. Word has length 21 [2022-03-15 20:24:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:09,540 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 2702 transitions. [2022-03-15 20:24:09,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 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:24:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2702 transitions. [2022-03-15 20:24:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:24:09,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:09,543 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:09,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:24:09,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:24:09,765 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1454588877, now seen corresponding path program 10 times [2022-03-15 20:24:09,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:09,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909046987] [2022-03-15 20:24:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:09,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:09,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909046987] [2022-03-15 20:24:09,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909046987] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:24:09,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104223907] [2022-03-15 20:24:09,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:24:09,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:24:09,908 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:24:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:24:12,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:24:12,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:24:12,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:24:12,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:12,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:24:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:12,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104223907] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:24:12,753 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:24:12,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 20:24:12,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79943585] [2022-03-15 20:24:12,754 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:12,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:12,762 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 20:24:12,762 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:12,841 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:12,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:24:12,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:12,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:24:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:12,842 INFO L87 Difference]: Start difference. First operand 1393 states and 2702 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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:24:14,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:24:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:15,416 INFO L93 Difference]: Finished difference Result 1394 states and 2703 transitions. [2022-03-15 20:24:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:24:15,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-03-15 20:24:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:15,419 INFO L225 Difference]: With dead ends: 1394 [2022-03-15 20:24:15,419 INFO L226 Difference]: Without dead ends: 1394 [2022-03-15 20:24:15,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:15,420 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:15,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:24:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-03-15 20:24:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2022-03-15 20:24:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1367 states have (on average 1.9773226042428675) internal successors, (2703), 1393 states have internal predecessors, (2703), 0 states have call successors, (0), 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:24:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2703 transitions. [2022-03-15 20:24:15,442 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2703 transitions. Word has length 21 [2022-03-15 20:24:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:15,442 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2703 transitions. [2022-03-15 20:24:15,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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:24:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2703 transitions. [2022-03-15 20:24:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:24:15,443 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:15,443 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:15,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 20:24:15,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 20:24:15,668 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1626986232, now seen corresponding path program 11 times [2022-03-15 20:24:15,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:15,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181425856] [2022-03-15 20:24:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:15,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:15,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181425856] [2022-03-15 20:24:15,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181425856] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:24:15,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916544140] [2022-03-15 20:24:15,826 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:24:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:24:15,827 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:24:15,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:24:16,817 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:24:16,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:24:16,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:24:16,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:16,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:24:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:16,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916544140] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:24:16,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:24:16,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2022-03-15 20:24:16,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128851805] [2022-03-15 20:24:16,907 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:16,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:16,944 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2022-03-15 20:24:16,944 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:16,991 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:16,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:24:16,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:24:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:16,992 INFO L87 Difference]: Start difference. First operand 1394 states and 2703 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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:24:19,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:24:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:19,722 INFO L93 Difference]: Finished difference Result 1395 states and 2704 transitions. [2022-03-15 20:24:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:24:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-03-15 20:24:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:19,724 INFO L225 Difference]: With dead ends: 1395 [2022-03-15 20:24:19,724 INFO L226 Difference]: Without dead ends: 1395 [2022-03-15 20:24:19,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:19,725 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:19,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 20:24:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-03-15 20:24:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2022-03-15 20:24:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1368 states have (on average 1.976608187134503) internal successors, (2704), 1394 states have internal predecessors, (2704), 0 states have call successors, (0), 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:24:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2704 transitions. [2022-03-15 20:24:19,740 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2704 transitions. Word has length 22 [2022-03-15 20:24:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:19,740 INFO L470 AbstractCegarLoop]: Abstraction has 1395 states and 2704 transitions. [2022-03-15 20:24:19,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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:24:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2704 transitions. [2022-03-15 20:24:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:24:19,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:19,741 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:19,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 20:24:19,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:19,959 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1628433197, now seen corresponding path program 12 times [2022-03-15 20:24:19,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:19,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866078089] [2022-03-15 20:24:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:19,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:20,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:20,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866078089] [2022-03-15 20:24:20,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866078089] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:24:20,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862619699] [2022-03-15 20:24:20,107 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:24:20,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:24:20,109 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:24:20,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:24:21,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 20:24:21,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:24:21,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 20:24:21,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:21,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:24:21,276 INFO L353 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-03-15 20:24:21,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 42 [2022-03-15 20:24:21,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 20:24:21,381 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:24:21,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-15 20:24:21,447 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:24:21,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-15 20:24:21,510 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:24:21,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-15 20:24:21,569 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 20:24:21,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:24:21,624 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:24:21,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:24:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:24:21,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:24:21,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862619699] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:21,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:24:21,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 19 [2022-03-15 20:24:21,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057121355] [2022-03-15 20:24:21,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:21,653 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:21,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2022-03-15 20:24:21,659 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:21,822 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:21,823 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:21,825 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:21,826 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:21,861 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:21,861 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:21,863 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:21,864 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:21,937 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:21,937 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:21,939 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:21,939 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:22,175 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [75072#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 75075#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 75074#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 75073#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:24:22,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:24:22,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:24:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:24:22,176 INFO L87 Difference]: Start difference. First operand 1395 states and 2704 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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:24:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:23,300 INFO L93 Difference]: Finished difference Result 1619 states and 3147 transitions. [2022-03-15 20:24:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:24:23,300 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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 23 [2022-03-15 20:24:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:23,303 INFO L225 Difference]: With dead ends: 1619 [2022-03-15 20:24:23,303 INFO L226 Difference]: Without dead ends: 1619 [2022-03-15 20:24:23,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:24:23,304 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:23,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 168 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 345 Invalid, 0 Unknown, 70 Unchecked, 1.1s Time] [2022-03-15 20:24:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-03-15 20:24:23,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1394. [2022-03-15 20:24:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1367 states have (on average 1.9765910753474762) internal successors, (2702), 1393 states have internal predecessors, (2702), 0 states have call successors, (0), 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:24:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2702 transitions. [2022-03-15 20:24:23,320 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2702 transitions. Word has length 23 [2022-03-15 20:24:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:23,320 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2702 transitions. [2022-03-15 20:24:23,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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:24:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2702 transitions. [2022-03-15 20:24:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:24:23,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:23,321 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:23,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:24:23,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:24:23,523 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash -826506005, now seen corresponding path program 13 times [2022-03-15 20:24:23,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:23,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909818952] [2022-03-15 20:24:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:23,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:23,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909818952] [2022-03-15 20:24:23,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909818952] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:24:23,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001658195] [2022-03-15 20:24:23,724 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:24:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:24:23,725 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:24:23,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:24:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:24,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:24:24,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:24:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:24,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:24:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:24,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001658195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:24:24,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:24:24,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2022-03-15 20:24:24,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022300467] [2022-03-15 20:24:24,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:24,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:24,918 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2022-03-15 20:24:24,918 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:24,921 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:24,922 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:24,923 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:24,924 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:24,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:24,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:24:24,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:24:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:24,980 INFO L87 Difference]: Start difference. First operand 1394 states and 2702 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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:24:27,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:24:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:27,778 INFO L93 Difference]: Finished difference Result 1395 states and 2703 transitions. [2022-03-15 20:24:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:24:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-03-15 20:24:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:27,780 INFO L225 Difference]: With dead ends: 1395 [2022-03-15 20:24:27,780 INFO L226 Difference]: Without dead ends: 1395 [2022-03-15 20:24:27,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:27,781 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:27,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:24:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-03-15 20:24:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2022-03-15 20:24:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1368 states have (on average 1.9758771929824561) internal successors, (2703), 1394 states have internal predecessors, (2703), 0 states have call successors, (0), 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:24:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2703 transitions. [2022-03-15 20:24:27,810 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2703 transitions. Word has length 23 [2022-03-15 20:24:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:27,810 INFO L470 AbstractCegarLoop]: Abstraction has 1395 states and 2703 transitions. [2022-03-15 20:24:27,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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:24:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2703 transitions. [2022-03-15 20:24:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:24:27,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:27,812 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:27,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:24:28,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:24:28,028 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1334706800, now seen corresponding path program 14 times [2022-03-15 20:24:28,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:28,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533954455] [2022-03-15 20:24:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:28,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:28,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533954455] [2022-03-15 20:24:28,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533954455] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:28,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:28,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:24:28,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [647826385] [2022-03-15 20:24:28,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:28,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:28,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 52 transitions. [2022-03-15 20:24:28,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:28,651 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:28,652 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:28,660 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:28,661 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:28,790 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:28,791 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:28,794 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:28,795 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:28,934 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:28,934 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:28,936 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:28,937 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:29,020 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [83824#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|))] [2022-03-15 20:24:29,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:24:29,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:24:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:24:29,021 INFO L87 Difference]: Start difference. First operand 1395 states and 2703 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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:24:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:31,091 INFO L93 Difference]: Finished difference Result 1636 states and 3114 transitions. [2022-03-15 20:24:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:24:31,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 24 [2022-03-15 20:24:31,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:31,094 INFO L225 Difference]: With dead ends: 1636 [2022-03-15 20:24:31,095 INFO L226 Difference]: Without dead ends: 1636 [2022-03-15 20:24:31,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:24:31,095 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 339 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:31,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 94 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:24:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-03-15 20:24:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1214. [2022-03-15 20:24:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1191 states have (on average 1.9638958858102435) internal successors, (2339), 1213 states have internal predecessors, (2339), 0 states have call successors, (0), 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:24:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2339 transitions. [2022-03-15 20:24:31,111 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2339 transitions. Word has length 24 [2022-03-15 20:24:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:31,111 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 2339 transitions. [2022-03-15 20:24:31,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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:24:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2339 transitions. [2022-03-15 20:24:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:24:31,112 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:31,112 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:31,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 20:24:31,112 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 88966435, now seen corresponding path program 1 times [2022-03-15 20:24:31,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:31,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717059210] [2022-03-15 20:24:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:31,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:31,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717059210] [2022-03-15 20:24:31,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717059210] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:31,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:31,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:24:31,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673863866] [2022-03-15 20:24:31,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:31,415 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:31,420 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 28 transitions. [2022-03-15 20:24:31,420 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:31,434 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:31,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:24:31,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:24:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:24:31,435 INFO L87 Difference]: Start difference. First operand 1214 states and 2339 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:24:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:34,811 INFO L93 Difference]: Finished difference Result 1247 states and 2365 transitions. [2022-03-15 20:24:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:24:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 24 [2022-03-15 20:24:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:34,841 INFO L225 Difference]: With dead ends: 1247 [2022-03-15 20:24:34,841 INFO L226 Difference]: Without dead ends: 1247 [2022-03-15 20:24:34,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:24:34,842 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 269 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:34,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 138 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:24:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-03-15 20:24:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1184. [2022-03-15 20:24:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1161 states have (on average 1.962962962962963) internal successors, (2279), 1183 states have internal predecessors, (2279), 0 states have call successors, (0), 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:24:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2279 transitions. [2022-03-15 20:24:34,860 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2279 transitions. Word has length 24 [2022-03-15 20:24:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:34,860 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2279 transitions. [2022-03-15 20:24:34,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:24:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2279 transitions. [2022-03-15 20:24:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:24:34,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:34,863 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:34,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 20:24:34,864 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1347088915, now seen corresponding path program 1 times [2022-03-15 20:24:34,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:34,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873645584] [2022-03-15 20:24:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:35,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:35,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873645584] [2022-03-15 20:24:35,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873645584] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:35,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:35,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:35,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1652150472] [2022-03-15 20:24:35,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:35,046 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:35,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2022-03-15 20:24:35,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:35,051 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:35,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:35,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:35,052 INFO L87 Difference]: Start difference. First operand 1184 states and 2279 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:24:37,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:24:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:38,098 INFO L93 Difference]: Finished difference Result 1382 states and 2670 transitions. [2022-03-15 20:24:38,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 26 [2022-03-15 20:24:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:38,101 INFO L225 Difference]: With dead ends: 1382 [2022-03-15 20:24:38,101 INFO L226 Difference]: Without dead ends: 1382 [2022-03-15 20:24:38,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:38,101 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:38,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 58 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 720 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:24:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-03-15 20:24:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1339. [2022-03-15 20:24:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1316 states have (on average 1.9642857142857142) internal successors, (2585), 1338 states have internal predecessors, (2585), 0 states have call successors, (0), 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:24:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2585 transitions. [2022-03-15 20:24:38,119 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2585 transitions. Word has length 26 [2022-03-15 20:24:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:38,119 INFO L470 AbstractCegarLoop]: Abstraction has 1339 states and 2585 transitions. [2022-03-15 20:24:38,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:24:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2585 transitions. [2022-03-15 20:24:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:24:38,119 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:38,119 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:38,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 20:24:38,120 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -492351558, now seen corresponding path program 1 times [2022-03-15 20:24:38,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:38,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780546126] [2022-03-15 20:24:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:38,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:38,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780546126] [2022-03-15 20:24:38,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780546126] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:38,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:38,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:38,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1637937717] [2022-03-15 20:24:38,292 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:38,296 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:38,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2022-03-15 20:24:38,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:38,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:38,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:38,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:38,302 INFO L87 Difference]: Start difference. First operand 1339 states and 2585 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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:24:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:40,519 INFO L93 Difference]: Finished difference Result 1419 states and 2741 transitions. [2022-03-15 20:24:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 27 [2022-03-15 20:24:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:40,522 INFO L225 Difference]: With dead ends: 1419 [2022-03-15 20:24:40,522 INFO L226 Difference]: Without dead ends: 1419 [2022-03-15 20:24:40,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:40,522 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:40,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:24:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-03-15 20:24:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2022-03-15 20:24:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1396 states have (on average 1.9634670487106016) internal successors, (2741), 1418 states have internal predecessors, (2741), 0 states have call successors, (0), 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:24:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2741 transitions. [2022-03-15 20:24:40,537 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2741 transitions. Word has length 27 [2022-03-15 20:24:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:40,537 INFO L470 AbstractCegarLoop]: Abstraction has 1419 states and 2741 transitions. [2022-03-15 20:24:40,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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:24:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2741 transitions. [2022-03-15 20:24:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:24:40,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:40,537 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:40,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 20:24:40,538 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1491505091, now seen corresponding path program 1 times [2022-03-15 20:24:40,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:40,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859880464] [2022-03-15 20:24:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:41,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:41,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859880464] [2022-03-15 20:24:41,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859880464] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:41,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:41,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:24:41,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1698473265] [2022-03-15 20:24:41,151 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:41,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:41,170 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 82 transitions. [2022-03-15 20:24:41,171 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:41,471 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:41,471 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:41,474 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:41,475 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:41,515 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:41,516 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:41,519 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:41,519 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:41,602 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:41,603 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:41,605 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:41,605 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:42,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 20:24:42,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 20:24:42,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 20:24:42,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 20:24:42,910 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [99890#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 99883#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))))), 99892#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 7 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 6 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 99887#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 99893#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 99882#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))))), 99884#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))))), 99895#(= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))), 99894#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 99889#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 99888#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 99891#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 99886#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 99885#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)))))] [2022-03-15 20:24:42,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:24:42,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:24:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:24:42,911 INFO L87 Difference]: Start difference. First operand 1419 states and 2741 transitions. Second operand has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 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:24:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:47,447 INFO L93 Difference]: Finished difference Result 2299 states and 4464 transitions. [2022-03-15 20:24:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:24:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 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 30 [2022-03-15 20:24:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:47,451 INFO L225 Difference]: With dead ends: 2299 [2022-03-15 20:24:47,452 INFO L226 Difference]: Without dead ends: 2299 [2022-03-15 20:24:47,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:24:47,452 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 586 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:47,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 120 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 20:24:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-03-15 20:24:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 1434. [2022-03-15 20:24:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1411 states have (on average 1.963855421686747) internal successors, (2771), 1433 states have internal predecessors, (2771), 0 states have call successors, (0), 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:24:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2771 transitions. [2022-03-15 20:24:47,470 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2771 transitions. Word has length 30 [2022-03-15 20:24:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:47,471 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 2771 transitions. [2022-03-15 20:24:47,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 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:24:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2771 transitions. [2022-03-15 20:24:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:24:47,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:47,471 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:47,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 20:24:47,471 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash -949372922, now seen corresponding path program 1 times [2022-03-15 20:24:47,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:47,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110219422] [2022-03-15 20:24:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:47,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:47,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110219422] [2022-03-15 20:24:47,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110219422] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:47,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:47,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:24:47,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541670979] [2022-03-15 20:24:47,914 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:47,919 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:47,930 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 58 transitions. [2022-03-15 20:24:47,930 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:48,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [105119#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 105116#(and (or (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 105113#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105118#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105112#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 105114#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 105117#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 105115#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105120#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))] [2022-03-15 20:24:48,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:24:48,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:24:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:24:48,422 INFO L87 Difference]: Start difference. First operand 1434 states and 2771 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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:24:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:51,371 INFO L93 Difference]: Finished difference Result 2310 states and 4487 transitions. [2022-03-15 20:24:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:24:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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 30 [2022-03-15 20:24:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:51,374 INFO L225 Difference]: With dead ends: 2310 [2022-03-15 20:24:51,375 INFO L226 Difference]: Without dead ends: 2310 [2022-03-15 20:24:51,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:24:51,375 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 467 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:51,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 116 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:24:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2022-03-15 20:24:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1437. [2022-03-15 20:24:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1414 states have (on average 1.963932107496464) internal successors, (2777), 1436 states have internal predecessors, (2777), 0 states have call successors, (0), 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:24:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2777 transitions. [2022-03-15 20:24:51,393 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2777 transitions. Word has length 30 [2022-03-15 20:24:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:51,393 INFO L470 AbstractCegarLoop]: Abstraction has 1437 states and 2777 transitions. [2022-03-15 20:24:51,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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:24:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2777 transitions. [2022-03-15 20:24:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:24:51,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:51,394 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:51,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 20:24:51,395 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash -911479142, now seen corresponding path program 2 times [2022-03-15 20:24:51,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:51,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918557070] [2022-03-15 20:24:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:52,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:52,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918557070] [2022-03-15 20:24:52,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918557070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:52,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:52,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:52,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237755126] [2022-03-15 20:24:52,142 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:52,147 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:52,158 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 58 transitions. [2022-03-15 20:24:52,158 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:52,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 20:24:52,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 20:24:52,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [110350#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 110354#(= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))), 110352#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 110348#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 110346#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 110347#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 110351#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 110349#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 110353#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 110345#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:24:52,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:24:52,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:24:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:24:52,736 INFO L87 Difference]: Start difference. First operand 1437 states and 2777 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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:24:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:56,383 INFO L93 Difference]: Finished difference Result 2310 states and 4487 transitions. [2022-03-15 20:24:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:24:56,383 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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) Word has length 30 [2022-03-15 20:24:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:56,387 INFO L225 Difference]: With dead ends: 2310 [2022-03-15 20:24:56,387 INFO L226 Difference]: Without dead ends: 2310 [2022-03-15 20:24:56,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:24:56,387 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 459 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:56,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 142 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 20:24:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2022-03-15 20:24:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1473. [2022-03-15 20:24:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1450 states have (on average 1.966206896551724) internal successors, (2851), 1472 states have internal predecessors, (2851), 0 states have call successors, (0), 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:24:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2851 transitions. [2022-03-15 20:24:56,419 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2851 transitions. Word has length 30 [2022-03-15 20:24:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:56,419 INFO L470 AbstractCegarLoop]: Abstraction has 1473 states and 2851 transitions. [2022-03-15 20:24:56,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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:24:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2851 transitions. [2022-03-15 20:24:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:24:56,420 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:56,420 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:56,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 20:24:56,420 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash -471636250, now seen corresponding path program 3 times [2022-03-15 20:24:56,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:56,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084858262] [2022-03-15 20:24:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:56,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:57,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:57,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084858262] [2022-03-15 20:24:57,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084858262] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:57,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:57,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:57,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591894867] [2022-03-15 20:24:57,075 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:57,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:57,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 52 transitions. [2022-03-15 20:24:57,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:57,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [115647#(and (not (= (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:24:57,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:24:57,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:24:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:57,269 INFO L87 Difference]: Start difference. First operand 1473 states and 2851 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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:25:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:00,140 INFO L93 Difference]: Finished difference Result 2404 states and 4690 transitions. [2022-03-15 20:25:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:25:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-03-15 20:25:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:00,144 INFO L225 Difference]: With dead ends: 2404 [2022-03-15 20:25:00,144 INFO L226 Difference]: Without dead ends: 2404 [2022-03-15 20:25:00,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:25:00,145 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 339 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:00,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 202 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:25:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2022-03-15 20:25:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1468. [2022-03-15 20:25:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1445 states have (on average 1.964705882352941) internal successors, (2839), 1467 states have internal predecessors, (2839), 0 states have call successors, (0), 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:25:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2839 transitions. [2022-03-15 20:25:00,165 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2839 transitions. Word has length 30 [2022-03-15 20:25:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:00,165 INFO L470 AbstractCegarLoop]: Abstraction has 1468 states and 2839 transitions. [2022-03-15 20:25:00,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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:25:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2839 transitions. [2022-03-15 20:25:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:25:00,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:00,166 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:00,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 20:25:00,166 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash -445381452, now seen corresponding path program 4 times [2022-03-15 20:25:00,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:00,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384341791] [2022-03-15 20:25:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:00,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:00,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384341791] [2022-03-15 20:25:00,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384341791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:00,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:00,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:00,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366028260] [2022-03-15 20:25:00,671 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:00,687 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:00,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 52 transitions. [2022-03-15 20:25:00,698 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:00,857 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [121026#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:00,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:00,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:00,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:00,858 INFO L87 Difference]: Start difference. First operand 1468 states and 2839 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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:25:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:03,533 INFO L93 Difference]: Finished difference Result 1878 states and 3612 transitions. [2022-03-15 20:25:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:25:03,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-03-15 20:25:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:03,548 INFO L225 Difference]: With dead ends: 1878 [2022-03-15 20:25:03,549 INFO L226 Difference]: Without dead ends: 1878 [2022-03-15 20:25:03,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:25:03,563 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 362 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:03,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 166 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:25:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-03-15 20:25:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1504. [2022-03-15 20:25:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1481 states have (on average 1.9675894665766374) internal successors, (2914), 1503 states have internal predecessors, (2914), 0 states have call successors, (0), 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:25:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2914 transitions. [2022-03-15 20:25:03,599 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2914 transitions. Word has length 30 [2022-03-15 20:25:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:03,599 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 2914 transitions. [2022-03-15 20:25:03,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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:25:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2914 transitions. [2022-03-15 20:25:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:25:03,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:03,600 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:03,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 20:25:03,600 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1614454382, now seen corresponding path program 1 times [2022-03-15 20:25:03,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:03,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865524846] [2022-03-15 20:25:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:03,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:03,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865524846] [2022-03-15 20:25:03,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865524846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:03,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:03,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:03,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950767245] [2022-03-15 20:25:03,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:03,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:03,944 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 34 transitions. [2022-03-15 20:25:03,944 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:03,959 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:03,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:25:03,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:25:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:03,961 INFO L87 Difference]: Start difference. First operand 1504 states and 2914 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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:25:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:05,514 INFO L93 Difference]: Finished difference Result 1536 states and 2939 transitions. [2022-03-15 20:25:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:25:05,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 30 [2022-03-15 20:25:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:05,516 INFO L225 Difference]: With dead ends: 1536 [2022-03-15 20:25:05,516 INFO L226 Difference]: Without dead ends: 1536 [2022-03-15 20:25:05,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:25:05,517 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 267 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:05,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 115 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:25:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-03-15 20:25:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1474. [2022-03-15 20:25:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1451 states have (on average 1.966919365954514) internal successors, (2854), 1473 states have internal predecessors, (2854), 0 states have call successors, (0), 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:25:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2854 transitions. [2022-03-15 20:25:05,531 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2854 transitions. Word has length 30 [2022-03-15 20:25:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:05,531 INFO L470 AbstractCegarLoop]: Abstraction has 1474 states and 2854 transitions. [2022-03-15 20:25:05,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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:25:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2854 transitions. [2022-03-15 20:25:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:25:05,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:05,532 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:05,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 20:25:05,532 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash -62729689, now seen corresponding path program 2 times [2022-03-15 20:25:05,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:05,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017888114] [2022-03-15 20:25:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:06,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:06,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017888114] [2022-03-15 20:25:06,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017888114] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:06,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:06,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:06,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113825734] [2022-03-15 20:25:06,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:06,264 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:06,271 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 30 transitions. [2022-03-15 20:25:06,271 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:06,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:06,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:06,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:06,272 INFO L87 Difference]: Start difference. First operand 1474 states and 2854 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 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:25:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:10,402 INFO L93 Difference]: Finished difference Result 2602 states and 5061 transitions. [2022-03-15 20:25:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:25:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 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 30 [2022-03-15 20:25:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:10,406 INFO L225 Difference]: With dead ends: 2602 [2022-03-15 20:25:10,406 INFO L226 Difference]: Without dead ends: 2602 [2022-03-15 20:25:10,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:10,407 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 467 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:10,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 161 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:25:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-03-15 20:25:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 1572. [2022-03-15 20:25:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1550 states have (on average 1.9670967741935483) internal successors, (3049), 1571 states have internal predecessors, (3049), 0 states have call successors, (0), 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:25:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3049 transitions. [2022-03-15 20:25:10,428 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3049 transitions. Word has length 30 [2022-03-15 20:25:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:10,428 INFO L470 AbstractCegarLoop]: Abstraction has 1572 states and 3049 transitions. [2022-03-15 20:25:10,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 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:25:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3049 transitions. [2022-03-15 20:25:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:25:10,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:10,429 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:10,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 20:25:10,429 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1073171226, now seen corresponding path program 5 times [2022-03-15 20:25:10,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:10,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576978468] [2022-03-15 20:25:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:10,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:10,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576978468] [2022-03-15 20:25:10,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576978468] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:10,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:10,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:10,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906477798] [2022-03-15 20:25:10,910 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:10,915 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:10,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 32 transitions. [2022-03-15 20:25:10,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:10,945 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [136234#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:10,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:10,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:10,947 INFO L87 Difference]: Start difference. First operand 1572 states and 3049 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:25:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:13,768 INFO L93 Difference]: Finished difference Result 2262 states and 4382 transitions. [2022-03-15 20:25:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:25:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 30 [2022-03-15 20:25:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:13,771 INFO L225 Difference]: With dead ends: 2262 [2022-03-15 20:25:13,771 INFO L226 Difference]: Without dead ends: 2262 [2022-03-15 20:25:13,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:25:13,773 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 304 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:13,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 169 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:25:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2022-03-15 20:25:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1487. [2022-03-15 20:25:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1465 states have (on average 1.9651877133105802) internal successors, (2879), 1486 states have internal predecessors, (2879), 0 states have call successors, (0), 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:25:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2879 transitions. [2022-03-15 20:25:13,790 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2879 transitions. Word has length 30 [2022-03-15 20:25:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:13,790 INFO L470 AbstractCegarLoop]: Abstraction has 1487 states and 2879 transitions. [2022-03-15 20:25:13,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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:25:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2879 transitions. [2022-03-15 20:25:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 20:25:13,791 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:13,791 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:13,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 20:25:13,792 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:13,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1007984902, now seen corresponding path program 1 times [2022-03-15 20:25:13,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:13,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236596306] [2022-03-15 20:25:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:14,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:14,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236596306] [2022-03-15 20:25:14,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236596306] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:14,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:14,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:14,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1961569169] [2022-03-15 20:25:14,233 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:14,237 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:14,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 83 transitions. [2022-03-15 20:25:14,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:14,359 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:14,360 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:14,362 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:14,362 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:14,379 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:14,380 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:14,382 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:14,382 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:14,402 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:14,402 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:14,404 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:14,404 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:14,947 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [141519#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 141514#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 141520#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 141515#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 141512#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)), 141522#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 141511#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)), 141513#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 141518#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 141521#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 141517#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 141523#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 141516#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:25:14,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:25:14,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:25:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:25:14,948 INFO L87 Difference]: Start difference. First operand 1487 states and 2879 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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:25:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:17,380 INFO L93 Difference]: Finished difference Result 2534 states and 4934 transitions. [2022-03-15 20:25:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:25:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 31 [2022-03-15 20:25:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:17,384 INFO L225 Difference]: With dead ends: 2534 [2022-03-15 20:25:17,384 INFO L226 Difference]: Without dead ends: 2534 [2022-03-15 20:25:17,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:25:17,385 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 335 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:17,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 170 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:25:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2022-03-15 20:25:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1367. [2022-03-15 20:25:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1345 states have (on average 1.9605947955390335) internal successors, (2637), 1366 states have internal predecessors, (2637), 0 states have call successors, (0), 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:25:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2637 transitions. [2022-03-15 20:25:17,435 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2637 transitions. Word has length 31 [2022-03-15 20:25:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:17,435 INFO L470 AbstractCegarLoop]: Abstraction has 1367 states and 2637 transitions. [2022-03-15 20:25:17,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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:25:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2637 transitions. [2022-03-15 20:25:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 20:25:17,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:17,436 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:17,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 20:25:17,437 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221223, now seen corresponding path program 1 times [2022-03-15 20:25:17,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:17,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840357340] [2022-03-15 20:25:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:17,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:17,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840357340] [2022-03-15 20:25:17,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840357340] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:17,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:17,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:17,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397774565] [2022-03-15 20:25:17,634 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:17,640 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:17,648 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 32 transitions. [2022-03-15 20:25:17,648 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:17,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:17,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:17,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:17,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:17,654 INFO L87 Difference]: Start difference. First operand 1367 states and 2637 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:25:20,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:25:21,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:25:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:21,898 INFO L93 Difference]: Finished difference Result 1653 states and 3156 transitions. [2022-03-15 20:25:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-03-15 20:25:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:21,901 INFO L225 Difference]: With dead ends: 1653 [2022-03-15 20:25:21,901 INFO L226 Difference]: Without dead ends: 1615 [2022-03-15 20:25:21,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:21,901 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 79 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:21,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 62 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 744 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 20:25:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2022-03-15 20:25:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1483. [2022-03-15 20:25:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1461 states have (on average 1.9582477754962355) internal successors, (2861), 1482 states have internal predecessors, (2861), 0 states have call successors, (0), 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:25:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2861 transitions. [2022-03-15 20:25:21,916 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2861 transitions. Word has length 32 [2022-03-15 20:25:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:21,916 INFO L470 AbstractCegarLoop]: Abstraction has 1483 states and 2861 transitions. [2022-03-15 20:25:21,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:25:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2861 transitions. [2022-03-15 20:25:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 20:25:21,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:21,917 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:21,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 20:25:21,917 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 602126818, now seen corresponding path program 1 times [2022-03-15 20:25:21,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:21,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522577925] [2022-03-15 20:25:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:22,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:22,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522577925] [2022-03-15 20:25:22,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522577925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:22,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:22,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:22,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755612263] [2022-03-15 20:25:22,059 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:22,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:22,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 32 transitions. [2022-03-15 20:25:22,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:22,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:22,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:22,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:22,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:22,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:22,073 INFO L87 Difference]: Start difference. First operand 1483 states and 2861 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:25:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:23,571 INFO L93 Difference]: Finished difference Result 1451 states and 2798 transitions. [2022-03-15 20:25:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-03-15 20:25:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:23,573 INFO L225 Difference]: With dead ends: 1451 [2022-03-15 20:25:23,573 INFO L226 Difference]: Without dead ends: 1451 [2022-03-15 20:25:23,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:23,574 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:23,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 56 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:25:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-03-15 20:25:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2022-03-15 20:25:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1432 states have (on average 1.9539106145251397) internal successors, (2798), 1450 states have internal predecessors, (2798), 0 states have call successors, (0), 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:25:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2798 transitions. [2022-03-15 20:25:23,588 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2798 transitions. Word has length 32 [2022-03-15 20:25:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:23,588 INFO L470 AbstractCegarLoop]: Abstraction has 1451 states and 2798 transitions. [2022-03-15 20:25:23,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:25:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2798 transitions. [2022-03-15 20:25:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 20:25:23,589 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:23,589 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:23,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 20:25:23,589 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 39472377, now seen corresponding path program 1 times [2022-03-15 20:25:23,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:23,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554227786] [2022-03-15 20:25:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:24,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:24,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554227786] [2022-03-15 20:25:24,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554227786] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:24,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:24,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:24,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335589715] [2022-03-15 20:25:24,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:24,089 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:24,103 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 61 transitions. [2022-03-15 20:25:24,103 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:24,328 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [155824#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= 1 |~#slot~0.offset|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:24,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:24,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:24,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:24,329 INFO L87 Difference]: Start difference. First operand 1451 states and 2798 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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:25:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:28,440 INFO L93 Difference]: Finished difference Result 1823 states and 3492 transitions. [2022-03-15 20:25:28,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:28,441 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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 35 [2022-03-15 20:25:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:28,443 INFO L225 Difference]: With dead ends: 1823 [2022-03-15 20:25:28,443 INFO L226 Difference]: Without dead ends: 1823 [2022-03-15 20:25:28,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:28,444 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 338 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:28,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 178 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-03-15 20:25:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2022-03-15 20:25:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1439. [2022-03-15 20:25:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1420 states have (on average 1.9535211267605634) internal successors, (2774), 1438 states have internal predecessors, (2774), 0 states have call successors, (0), 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:25:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2774 transitions. [2022-03-15 20:25:28,460 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2774 transitions. Word has length 35 [2022-03-15 20:25:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:28,460 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 2774 transitions. [2022-03-15 20:25:28,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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:25:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2774 transitions. [2022-03-15 20:25:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 20:25:28,460 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:28,461 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:28,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 20:25:28,461 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1081826257, now seen corresponding path program 2 times [2022-03-15 20:25:28,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:28,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137190397] [2022-03-15 20:25:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:29,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:29,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137190397] [2022-03-15 20:25:29,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137190397] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:29,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:29,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:29,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405934985] [2022-03-15 20:25:29,134 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:29,140 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:29,155 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 63 transitions. [2022-03-15 20:25:29,155 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:29,394 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [160560#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)))] [2022-03-15 20:25:29,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:29,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:29,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:29,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:29,395 INFO L87 Difference]: Start difference. First operand 1439 states and 2774 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:32,643 INFO L93 Difference]: Finished difference Result 1813 states and 3472 transitions. [2022-03-15 20:25:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:25:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 20:25:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:32,648 INFO L225 Difference]: With dead ends: 1813 [2022-03-15 20:25:32,648 INFO L226 Difference]: Without dead ends: 1813 [2022-03-15 20:25:32,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:32,649 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 340 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:32,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 163 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 20:25:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-03-15 20:25:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1424. [2022-03-15 20:25:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1405 states have (on average 1.9530249110320286) internal successors, (2744), 1423 states have internal predecessors, (2744), 0 states have call successors, (0), 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:25:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2744 transitions. [2022-03-15 20:25:32,699 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2744 transitions. Word has length 35 [2022-03-15 20:25:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:32,700 INFO L470 AbstractCegarLoop]: Abstraction has 1424 states and 2744 transitions. [2022-03-15 20:25:32,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2744 transitions. [2022-03-15 20:25:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 20:25:32,711 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:32,711 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:32,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 20:25:32,711 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1053976197, now seen corresponding path program 3 times [2022-03-15 20:25:32,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:32,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109042521] [2022-03-15 20:25:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:33,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:33,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109042521] [2022-03-15 20:25:33,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109042521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:33,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:33,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:33,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112145480] [2022-03-15 20:25:33,032 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:33,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:33,052 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 59 transitions. [2022-03-15 20:25:33,052 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:33,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [165256#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))] [2022-03-15 20:25:33,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:33,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:33,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:33,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:33,190 INFO L87 Difference]: Start difference. First operand 1424 states and 2744 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:36,588 INFO L93 Difference]: Finished difference Result 1743 states and 3332 transitions. [2022-03-15 20:25:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:25:36,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 20:25:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:36,590 INFO L225 Difference]: With dead ends: 1743 [2022-03-15 20:25:36,590 INFO L226 Difference]: Without dead ends: 1743 [2022-03-15 20:25:36,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:25:36,591 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 355 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:36,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 157 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 20:25:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2022-03-15 20:25:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1401. [2022-03-15 20:25:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1382 states have (on average 1.9522431259044863) internal successors, (2698), 1400 states have internal predecessors, (2698), 0 states have call successors, (0), 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:25:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2698 transitions. [2022-03-15 20:25:36,624 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2698 transitions. Word has length 35 [2022-03-15 20:25:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:36,624 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 2698 transitions. [2022-03-15 20:25:36,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2698 transitions. [2022-03-15 20:25:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:36,625 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:36,625 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:36,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 20:25:36,625 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 947328055, now seen corresponding path program 1 times [2022-03-15 20:25:36,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:36,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785506268] [2022-03-15 20:25:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:37,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:37,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785506268] [2022-03-15 20:25:37,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785506268] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:37,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:37,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:25:37,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210002419] [2022-03-15 20:25:37,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:37,337 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:37,360 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 112 transitions. [2022-03-15 20:25:37,360 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:37,477 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:37,477 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:37,479 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:37,479 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:37,495 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:37,497 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:37,499 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:37,500 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:37,513 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:37,513 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:37,516 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:37,516 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:38,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [169850#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|))), 169869#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 169860#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 169863#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 1)), 169873#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1), 169864#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 1)), 169855#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 169870#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 169852#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 169871#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 169872#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 169866#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 1)), 169862#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 169858#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 169865#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 1)), 169857#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 169848#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ 2 |ULTIMATE.start_main_~p~1#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ |ULTIMATE.start_main_~p~1#1.offset| 1)) 0)), 169868#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1), 169849#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ |ULTIMATE.start_main_~p~1#1.offset| 1)) 0)), 169854#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 169856#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)), 169861#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 169867#(= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 1), 169859#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 169851#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|)), 169853#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))] [2022-03-15 20:25:38,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 20:25:38,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:38,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 20:25:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:25:38,571 INFO L87 Difference]: Start difference. First operand 1401 states and 2698 transitions. Second operand has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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:25:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:46,986 INFO L93 Difference]: Finished difference Result 2545 states and 4801 transitions. [2022-03-15 20:25:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 20:25:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:46,990 INFO L225 Difference]: With dead ends: 2545 [2022-03-15 20:25:46,990 INFO L226 Difference]: Without dead ends: 2545 [2022-03-15 20:25:46,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=612, Invalid=4080, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 20:25:46,991 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 816 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 4914 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 5237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 4914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:46,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 348 Invalid, 5237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 4914 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-03-15 20:25:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2022-03-15 20:25:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1570. [2022-03-15 20:25:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1551 states have (on average 1.9638942617666022) internal successors, (3046), 1569 states have internal predecessors, (3046), 0 states have call successors, (0), 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:25:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3046 transitions. [2022-03-15 20:25:47,010 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3046 transitions. Word has length 36 [2022-03-15 20:25:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:47,011 INFO L470 AbstractCegarLoop]: Abstraction has 1570 states and 3046 transitions. [2022-03-15 20:25:47,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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:25:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3046 transitions. [2022-03-15 20:25:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:47,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:47,012 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:47,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 20:25:47,012 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash 804420709, now seen corresponding path program 1 times [2022-03-15 20:25:47,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:47,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614271995] [2022-03-15 20:25:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:47,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:47,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614271995] [2022-03-15 20:25:47,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614271995] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:47,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:47,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:47,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189132351] [2022-03-15 20:25:47,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:47,470 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:47,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 20:25:47,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:48,442 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [175630#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175633#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (= |ULTIMATE.start_main_#t~mem50#1.base| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175641#(or (= |ULTIMATE.start_main_#t~mem50#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0))), 175648#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 175651#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0)), 175637#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 175640#(or (= |ULTIMATE.start_main_#t~mem50#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175644#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 175642#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 175645#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 175647#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 175643#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 175650#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 175646#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 175636#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)), 175634#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175649#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 175632#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (= |ULTIMATE.start_main_#t~mem50#1.base| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175631#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175638#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 175635#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 175639#(or (= |ULTIMATE.start_main_#t~mem50#1.base| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))] [2022-03-15 20:25:48,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:25:48,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:25:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:25:48,443 INFO L87 Difference]: Start difference. First operand 1570 states and 3046 transitions. Second operand has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 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:25:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:56,522 INFO L93 Difference]: Finished difference Result 2382 states and 4532 transitions. [2022-03-15 20:25:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 20:25:56,522 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:56,525 INFO L225 Difference]: With dead ends: 2382 [2022-03-15 20:25:56,526 INFO L226 Difference]: Without dead ends: 2382 [2022-03-15 20:25:56,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=704, Invalid=4126, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:25:56,527 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 727 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:56,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 345 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-03-15 20:25:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2022-03-15 20:25:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1582. [2022-03-15 20:25:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1563 states have (on average 1.964171465131158) internal successors, (3070), 1581 states have internal predecessors, (3070), 0 states have call successors, (0), 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:25:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 3070 transitions. [2022-03-15 20:25:56,545 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 3070 transitions. Word has length 36 [2022-03-15 20:25:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:56,545 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 3070 transitions. [2022-03-15 20:25:56,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 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:25:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 3070 transitions. [2022-03-15 20:25:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:56,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:56,546 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:56,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 20:25:56,547 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2060557268, now seen corresponding path program 1 times [2022-03-15 20:25:56,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:56,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624684263] [2022-03-15 20:25:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:57,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:57,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624684263] [2022-03-15 20:25:57,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624684263] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:57,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:57,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:57,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [997346777] [2022-03-15 20:25:57,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:57,044 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:57,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 20:25:57,095 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:57,247 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,248 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,251 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,251 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,286 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,286 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,289 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,289 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,301 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,302 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,303 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,303 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [181283#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)), 181292#(not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 181293#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)), 181288#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 181286#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 181287#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 181291#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 181289#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 181285#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 181282#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 181284#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 181280#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)), 181290#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 181281#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0))] [2022-03-15 20:25:57,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:25:57,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:25:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:25:57,865 INFO L87 Difference]: Start difference. First operand 1582 states and 3070 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 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:26:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:01,358 INFO L93 Difference]: Finished difference Result 2311 states and 4479 transitions. [2022-03-15 20:26:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:26:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:01,361 INFO L225 Difference]: With dead ends: 2311 [2022-03-15 20:26:01,361 INFO L226 Difference]: Without dead ends: 2311 [2022-03-15 20:26:01,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=501, Invalid=1479, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:26:01,362 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 495 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:01,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 226 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 20:26:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-03-15 20:26:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1699. [2022-03-15 20:26:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1680 states have (on average 1.963095238095238) internal successors, (3298), 1698 states have internal predecessors, (3298), 0 states have call successors, (0), 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:26:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3298 transitions. [2022-03-15 20:26:01,380 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3298 transitions. Word has length 36 [2022-03-15 20:26:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:01,380 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 3298 transitions. [2022-03-15 20:26:01,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 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:26:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3298 transitions. [2022-03-15 20:26:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:01,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:01,381 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:01,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 20:26:01,381 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1042830267, now seen corresponding path program 2 times [2022-03-15 20:26:01,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:01,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63908170] [2022-03-15 20:26:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:01,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:01,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63908170] [2022-03-15 20:26:01,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63908170] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:01,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:01,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:01,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084901800] [2022-03-15 20:26:01,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:01,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:01,872 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 82 transitions. [2022-03-15 20:26:01,872 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:02,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [187061#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 187062#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 187056#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 187063#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 187057#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 187059#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 187060#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 187054#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 187055#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 187058#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:02,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:26:02,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:26:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:26:02,597 INFO L87 Difference]: Start difference. First operand 1699 states and 3298 transitions. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 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:26:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:09,351 INFO L93 Difference]: Finished difference Result 2243 states and 4342 transitions. [2022-03-15 20:26:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 20:26:09,352 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:09,355 INFO L225 Difference]: With dead ends: 2243 [2022-03-15 20:26:09,355 INFO L226 Difference]: Without dead ends: 2243 [2022-03-15 20:26:09,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=637, Invalid=2443, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 20:26:09,356 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 579 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:09,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 242 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-03-15 20:26:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-03-15 20:26:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1732. [2022-03-15 20:26:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1713 states have (on average 1.9614711033274956) internal successors, (3360), 1731 states have internal predecessors, (3360), 0 states have call successors, (0), 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:26:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3360 transitions. [2022-03-15 20:26:09,375 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3360 transitions. Word has length 36 [2022-03-15 20:26:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:09,375 INFO L470 AbstractCegarLoop]: Abstraction has 1732 states and 3360 transitions. [2022-03-15 20:26:09,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 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:26:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3360 transitions. [2022-03-15 20:26:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:09,376 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:09,376 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:09,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 20:26:09,376 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1384621771, now seen corresponding path program 1 times [2022-03-15 20:26:09,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:09,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056963233] [2022-03-15 20:26:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:09,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:09,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056963233] [2022-03-15 20:26:09,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056963233] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:09,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:09,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:09,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17565776] [2022-03-15 20:26:09,752 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:09,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:09,773 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 64 transitions. [2022-03-15 20:26:09,774 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:10,139 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [192850#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 192857#(or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 192858#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1), 192854#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 192855#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 192856#(or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 192849#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 192851#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 192853#(not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 192852#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))] [2022-03-15 20:26:10,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:26:10,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:26:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:26:10,140 INFO L87 Difference]: Start difference. First operand 1732 states and 3360 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:14,265 INFO L93 Difference]: Finished difference Result 2289 states and 4433 transitions. [2022-03-15 20:26:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:26:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:14,269 INFO L225 Difference]: With dead ends: 2289 [2022-03-15 20:26:14,269 INFO L226 Difference]: Without dead ends: 2289 [2022-03-15 20:26:14,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:26:14,270 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 416 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:14,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 217 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:26:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2022-03-15 20:26:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1726. [2022-03-15 20:26:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1707 states have (on average 1.961335676625659) internal successors, (3348), 1725 states have internal predecessors, (3348), 0 states have call successors, (0), 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:26:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3348 transitions. [2022-03-15 20:26:14,288 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3348 transitions. Word has length 36 [2022-03-15 20:26:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:14,288 INFO L470 AbstractCegarLoop]: Abstraction has 1726 states and 3348 transitions. [2022-03-15 20:26:14,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 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:26:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3348 transitions. [2022-03-15 20:26:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:14,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:14,289 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:14,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 20:26:14,290 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1481368377, now seen corresponding path program 2 times [2022-03-15 20:26:14,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:14,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774121736] [2022-03-15 20:26:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:14,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:14,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774121736] [2022-03-15 20:26:14,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774121736] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:14,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:14,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:14,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029573692] [2022-03-15 20:26:14,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:14,939 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:14,955 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 70 transitions. [2022-03-15 20:26:14,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:15,043 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,044 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2022-03-15 20:26:15,059 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,059 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:15,426 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,427 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2022-03-15 20:26:15,440 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,440 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:15,548 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,563 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-03-15 20:26:15,579 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,579 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:15,670 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,671 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2022-03-15 20:26:15,678 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:15,679 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:16,288 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:16,288 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:16,291 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:16,292 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:16,391 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [198644#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198650#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198646#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 198651#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198643#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198647#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198652#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198654#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 198645#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198653#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 198649#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 198648#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 198642#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:16,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:26:16,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:26:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:26:16,392 INFO L87 Difference]: Start difference. First operand 1726 states and 3348 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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:26:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:23,075 INFO L93 Difference]: Finished difference Result 2977 states and 5699 transitions. [2022-03-15 20:26:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:26:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:23,079 INFO L225 Difference]: With dead ends: 2977 [2022-03-15 20:26:23,079 INFO L226 Difference]: Without dead ends: 2977 [2022-03-15 20:26:23,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=459, Invalid=2403, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:26:23,080 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 911 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 3478 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 3478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:23,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [911 Valid, 285 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 3478 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-03-15 20:26:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2022-03-15 20:26:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1695. [2022-03-15 20:26:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1676 states have (on average 1.9630071599045347) internal successors, (3290), 1694 states have internal predecessors, (3290), 0 states have call successors, (0), 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:26:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3290 transitions. [2022-03-15 20:26:23,099 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 3290 transitions. Word has length 36 [2022-03-15 20:26:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:23,099 INFO L470 AbstractCegarLoop]: Abstraction has 1695 states and 3290 transitions. [2022-03-15 20:26:23,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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:26:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3290 transitions. [2022-03-15 20:26:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:23,100 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:23,100 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:23,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 20:26:23,101 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1209973129, now seen corresponding path program 3 times [2022-03-15 20:26:23,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:23,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012599803] [2022-03-15 20:26:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:23,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:23,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012599803] [2022-03-15 20:26:23,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012599803] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:23,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:23,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:26:23,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [21591349] [2022-03-15 20:26:23,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:23,687 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:23,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 72 transitions. [2022-03-15 20:26:23,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:23,978 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,979 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:23,982 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,985 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2022-03-15 20:26:24,071 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,071 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:24,075 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,075 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2022-03-15 20:26:24,167 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,168 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:24,172 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,173 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-03-15 20:26:24,250 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,251 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2022-03-15 20:26:24,256 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,257 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:24,309 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,309 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:24,312 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:24,312 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:24,639 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [205093#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205095#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205100#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205094#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 205096#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205103#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 205104#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 205097#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205091#(and (or (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205099#(and (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1) 1) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 205101#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205092#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 205098#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 205102#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:24,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:26:24,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:26:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:26:24,640 INFO L87 Difference]: Start difference. First operand 1695 states and 3290 transitions. Second operand has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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:26:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:30,106 INFO L93 Difference]: Finished difference Result 2790 states and 5373 transitions. [2022-03-15 20:26:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 20:26:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:30,109 INFO L225 Difference]: With dead ends: 2790 [2022-03-15 20:26:30,110 INFO L226 Difference]: Without dead ends: 2790 [2022-03-15 20:26:30,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=868, Invalid=3554, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 20:26:30,111 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 842 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:30,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [842 Valid, 303 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 20:26:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2022-03-15 20:26:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1679. [2022-03-15 20:26:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1660 states have (on average 1.9626506024096386) internal successors, (3258), 1678 states have internal predecessors, (3258), 0 states have call successors, (0), 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:26:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3258 transitions. [2022-03-15 20:26:30,131 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3258 transitions. Word has length 36 [2022-03-15 20:26:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:30,131 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3258 transitions. [2022-03-15 20:26:30,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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:26:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3258 transitions. [2022-03-15 20:26:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:30,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:30,132 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:30,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 20:26:30,132 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -198590619, now seen corresponding path program 2 times [2022-03-15 20:26:30,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:30,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529961032] [2022-03-15 20:26:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:30,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:30,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529961032] [2022-03-15 20:26:30,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529961032] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:30,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:30,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:30,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131561948] [2022-03-15 20:26:30,510 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:30,515 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:30,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 58 transitions. [2022-03-15 20:26:30,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:30,662 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [211341#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))] [2022-03-15 20:26:30,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:30,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:30,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:30,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:30,662 INFO L87 Difference]: Start difference. First operand 1679 states and 3258 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:34,853 INFO L93 Difference]: Finished difference Result 2061 states and 3972 transitions. [2022-03-15 20:26:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:26:34,854 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:34,856 INFO L225 Difference]: With dead ends: 2061 [2022-03-15 20:26:34,856 INFO L226 Difference]: Without dead ends: 2061 [2022-03-15 20:26:34,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:26:34,857 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 343 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:34,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 178 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:26:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2022-03-15 20:26:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1718. [2022-03-15 20:26:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1699 states have (on average 1.9652736904061212) internal successors, (3339), 1717 states have internal predecessors, (3339), 0 states have call successors, (0), 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:26:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 3339 transitions. [2022-03-15 20:26:34,873 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 3339 transitions. Word has length 36 [2022-03-15 20:26:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:34,874 INFO L470 AbstractCegarLoop]: Abstraction has 1718 states and 3339 transitions. [2022-03-15 20:26:34,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3339 transitions. [2022-03-15 20:26:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:34,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:34,875 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:34,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 20:26:34,875 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash 310363061, now seen corresponding path program 4 times [2022-03-15 20:26:34,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:34,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770456340] [2022-03-15 20:26:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:34,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:35,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:35,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770456340] [2022-03-15 20:26:35,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770456340] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:35,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:35,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:35,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548173558] [2022-03-15 20:26:35,695 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:35,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:35,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 58 transitions. [2022-03-15 20:26:35,715 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:35,765 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:35,765 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:35,768 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:35,769 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:35,787 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:35,787 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:35,790 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:35,791 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:35,809 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:35,810 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:35,813 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:35,814 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:35,964 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [216873#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:26:35,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:35,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:35,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:35,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:35,965 INFO L87 Difference]: Start difference. First operand 1718 states and 3339 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:38,504 INFO L93 Difference]: Finished difference Result 1832 states and 3541 transitions. [2022-03-15 20:26:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:26:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:38,506 INFO L225 Difference]: With dead ends: 1832 [2022-03-15 20:26:38,507 INFO L226 Difference]: Without dead ends: 1832 [2022-03-15 20:26:38,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:26:38,507 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 274 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:38,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 139 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:26:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-03-15 20:26:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1751. [2022-03-15 20:26:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1732 states have (on average 1.9659353348729791) internal successors, (3405), 1750 states have internal predecessors, (3405), 0 states have call successors, (0), 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:26:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 3405 transitions. [2022-03-15 20:26:38,523 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 3405 transitions. Word has length 36 [2022-03-15 20:26:38,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:38,523 INFO L470 AbstractCegarLoop]: Abstraction has 1751 states and 3405 transitions. [2022-03-15 20:26:38,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 3405 transitions. [2022-03-15 20:26:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:38,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:38,524 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:38,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-15 20:26:38,524 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2094232869, now seen corresponding path program 5 times [2022-03-15 20:26:38,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:38,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553608699] [2022-03-15 20:26:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:39,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:39,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553608699] [2022-03-15 20:26:39,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553608699] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:39,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:39,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:39,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997219486] [2022-03-15 20:26:39,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:39,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:39,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 54 transitions. [2022-03-15 20:26:39,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:39,318 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:39,319 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:39,322 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:39,322 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:39,359 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:39,360 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:39,363 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:39,363 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:39,516 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [222247#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 222246#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 2)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 3)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4))] [2022-03-15 20:26:39,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:26:39,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:26:39,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:26:39,516 INFO L87 Difference]: Start difference. First operand 1751 states and 3405 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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:26:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:44,915 INFO L93 Difference]: Finished difference Result 1862 states and 3601 transitions. [2022-03-15 20:26:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:26:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:44,917 INFO L225 Difference]: With dead ends: 1862 [2022-03-15 20:26:44,917 INFO L226 Difference]: Without dead ends: 1862 [2022-03-15 20:26:44,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:26:44,918 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 282 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:44,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 154 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 20:26:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2022-03-15 20:26:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1761. [2022-03-15 20:26:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1742 states have (on average 1.9661308840413318) internal successors, (3425), 1760 states have internal predecessors, (3425), 0 states have call successors, (0), 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:26:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 3425 transitions. [2022-03-15 20:26:44,934 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 3425 transitions. Word has length 36 [2022-03-15 20:26:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:44,934 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 3425 transitions. [2022-03-15 20:26:44,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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:26:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 3425 transitions. [2022-03-15 20:26:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:44,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:44,935 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:44,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 20:26:44,936 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -23339869, now seen corresponding path program 6 times [2022-03-15 20:26:44,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:44,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144208712] [2022-03-15 20:26:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:45,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:45,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144208712] [2022-03-15 20:26:45,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144208712] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:45,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:45,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:45,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894618101] [2022-03-15 20:26:45,620 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:45,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:45,638 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 54 transitions. [2022-03-15 20:26:45,639 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:45,673 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:45,673 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:45,682 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:45,683 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:45,734 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:45,735 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:45,739 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:45,740 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:45,848 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [227674#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:26:45,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:45,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:45,848 INFO L87 Difference]: Start difference. First operand 1761 states and 3425 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:51,817 INFO L93 Difference]: Finished difference Result 1875 states and 3625 transitions. [2022-03-15 20:26:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:26:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:26:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:51,820 INFO L225 Difference]: With dead ends: 1875 [2022-03-15 20:26:51,820 INFO L226 Difference]: Without dead ends: 1875 [2022-03-15 20:26:51,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:26:51,820 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 241 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:51,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 154 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 20:26:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-03-15 20:26:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1762. [2022-03-15 20:26:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1743 states have (on average 1.9661503155479059) internal successors, (3427), 1761 states have internal predecessors, (3427), 0 states have call successors, (0), 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:26:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3427 transitions. [2022-03-15 20:26:51,837 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3427 transitions. Word has length 36 [2022-03-15 20:26:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:51,837 INFO L470 AbstractCegarLoop]: Abstraction has 1762 states and 3427 transitions. [2022-03-15 20:26:51,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3427 transitions. [2022-03-15 20:26:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:51,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:51,838 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:51,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-15 20:26:51,838 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -24430813, now seen corresponding path program 7 times [2022-03-15 20:26:51,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:51,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861771745] [2022-03-15 20:26:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:52,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:52,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861771745] [2022-03-15 20:26:52,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861771745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:52,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:52,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:52,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1898973949] [2022-03-15 20:26:52,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:52,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:52,501 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 50 transitions. [2022-03-15 20:26:52,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:52,521 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:52,522 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:52,524 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:52,525 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:52,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [233121#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 2)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 3)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)), 233120#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 233122#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 2)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))] [2022-03-15 20:26:52,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:26:52,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:52,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:26:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:26:52,744 INFO L87 Difference]: Start difference. First operand 1762 states and 3427 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:57,332 INFO L93 Difference]: Finished difference Result 1898 states and 3673 transitions. [2022-03-15 20:26:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:26:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:26:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:57,335 INFO L225 Difference]: With dead ends: 1898 [2022-03-15 20:26:57,335 INFO L226 Difference]: Without dead ends: 1898 [2022-03-15 20:26:57,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:26:57,335 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 287 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:57,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 154 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:26:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-03-15 20:26:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1782. [2022-03-15 20:26:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1763 states have (on average 1.9665343165059557) internal successors, (3467), 1781 states have internal predecessors, (3467), 0 states have call successors, (0), 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:26:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 3467 transitions. [2022-03-15 20:26:57,352 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 3467 transitions. Word has length 36 [2022-03-15 20:26:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:57,352 INFO L470 AbstractCegarLoop]: Abstraction has 1782 states and 3467 transitions. [2022-03-15 20:26:57,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 3467 transitions. [2022-03-15 20:26:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:57,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:57,353 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:57,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-15 20:26:57,353 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2046462187, now seen corresponding path program 8 times [2022-03-15 20:26:57,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:57,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584751850] [2022-03-15 20:26:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:58,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:58,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584751850] [2022-03-15 20:26:58,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584751850] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:58,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:58,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-15 20:26:58,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220444983] [2022-03-15 20:26:58,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:58,115 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:58,128 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 50 transitions. [2022-03-15 20:26:58,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:58,152 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:58,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:26:58,155 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:58,156 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:58,316 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [238631#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 0 |~#slot~0.offset|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 238632#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 2)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4))] [2022-03-15 20:26:58,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:26:58,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:58,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:26:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:26:58,317 INFO L87 Difference]: Start difference. First operand 1782 states and 3467 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 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:27:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:05,539 INFO L93 Difference]: Finished difference Result 1912 states and 3699 transitions. [2022-03-15 20:27:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:27:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:05,542 INFO L225 Difference]: With dead ends: 1912 [2022-03-15 20:27:05,542 INFO L226 Difference]: Without dead ends: 1912 [2022-03-15 20:27:05,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:27:05,543 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 245 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:05,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 154 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-03-15 20:27:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-03-15 20:27:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1772. [2022-03-15 20:27:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1753 states have (on average 1.966343411294923) internal successors, (3447), 1771 states have internal predecessors, (3447), 0 states have call successors, (0), 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:27:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 3447 transitions. [2022-03-15 20:27:05,560 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 3447 transitions. Word has length 36 [2022-03-15 20:27:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:05,560 INFO L470 AbstractCegarLoop]: Abstraction has 1772 states and 3447 transitions. [2022-03-15 20:27:05,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 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:27:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 3447 transitions. [2022-03-15 20:27:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:05,561 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:05,561 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:05,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-15 20:27:05,561 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:05,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1622198721, now seen corresponding path program 9 times [2022-03-15 20:27:05,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:05,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881913993] [2022-03-15 20:27:05,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:06,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:06,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881913993] [2022-03-15 20:27:06,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881913993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:06,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:06,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:27:06,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420141419] [2022-03-15 20:27:06,199 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:06,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:06,217 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 50 transitions. [2022-03-15 20:27:06,217 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:06,241 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:06,241 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:06,244 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:06,244 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:06,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [244138#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:27:06,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:27:06,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:27:06,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:27:06,381 INFO L87 Difference]: Start difference. First operand 1772 states and 3447 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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:27:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:10,983 INFO L93 Difference]: Finished difference Result 1937 states and 3745 transitions. [2022-03-15 20:27:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:27:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:10,986 INFO L225 Difference]: With dead ends: 1937 [2022-03-15 20:27:10,986 INFO L226 Difference]: Without dead ends: 1937 [2022-03-15 20:27:10,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:27:10,986 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 242 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:10,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 154 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 20:27:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2022-03-15 20:27:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1772. [2022-03-15 20:27:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1753 states have (on average 1.966343411294923) internal successors, (3447), 1771 states have internal predecessors, (3447), 0 states have call successors, (0), 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:27:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 3447 transitions. [2022-03-15 20:27:11,002 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 3447 transitions. Word has length 36 [2022-03-15 20:27:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:11,002 INFO L470 AbstractCegarLoop]: Abstraction has 1772 states and 3447 transitions. [2022-03-15 20:27:11,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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:27:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 3447 transitions. [2022-03-15 20:27:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:11,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:11,003 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:11,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-15 20:27:11,003 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 639086693, now seen corresponding path program 10 times [2022-03-15 20:27:11,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:11,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339534838] [2022-03-15 20:27:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:11,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:11,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339534838] [2022-03-15 20:27:11,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339534838] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:11,575 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:11,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:11,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431166114] [2022-03-15 20:27:11,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:11,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:11,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 40 transitions. [2022-03-15 20:27:11,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:11,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [249664#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:27:11,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:27:11,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:11,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:27:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:27:11,649 INFO L87 Difference]: Start difference. First operand 1772 states and 3447 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:16,028 INFO L93 Difference]: Finished difference Result 1955 states and 3773 transitions. [2022-03-15 20:27:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:27:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:27:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:16,031 INFO L225 Difference]: With dead ends: 1955 [2022-03-15 20:27:16,031 INFO L226 Difference]: Without dead ends: 1955 [2022-03-15 20:27:16,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=593, Invalid=1569, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:27:16,037 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 305 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:16,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 145 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-15 20:27:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2022-03-15 20:27:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1713. [2022-03-15 20:27:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1694 states have (on average 1.962809917355372) internal successors, (3325), 1712 states have internal predecessors, (3325), 0 states have call successors, (0), 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:27:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 3325 transitions. [2022-03-15 20:27:16,054 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 3325 transitions. Word has length 36 [2022-03-15 20:27:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:16,054 INFO L470 AbstractCegarLoop]: Abstraction has 1713 states and 3325 transitions. [2022-03-15 20:27:16,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 3325 transitions. [2022-03-15 20:27:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:16,055 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:16,055 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:16,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-15 20:27:16,055 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1532962743, now seen corresponding path program 3 times [2022-03-15 20:27:16,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:16,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626444027] [2022-03-15 20:27:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:16,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:16,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626444027] [2022-03-15 20:27:16,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626444027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:16,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:16,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:27:16,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43463957] [2022-03-15 20:27:16,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:16,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:16,771 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 36 transitions. [2022-03-15 20:27:16,771 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:16,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:16,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:27:16,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:16,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:27:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:27:16,772 INFO L87 Difference]: Start difference. First operand 1713 states and 3325 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:23,605 INFO L93 Difference]: Finished difference Result 2788 states and 5344 transitions. [2022-03-15 20:27:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:27:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:23,608 INFO L225 Difference]: With dead ends: 2788 [2022-03-15 20:27:23,608 INFO L226 Difference]: Without dead ends: 2788 [2022-03-15 20:27:23,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:27:23,609 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 274 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:23,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 526 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3461 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-03-15 20:27:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-03-15 20:27:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1666. [2022-03-15 20:27:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1648 states have (on average 1.9641990291262137) internal successors, (3237), 1665 states have internal predecessors, (3237), 0 states have call successors, (0), 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:27:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 3237 transitions. [2022-03-15 20:27:23,627 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 3237 transitions. Word has length 36 [2022-03-15 20:27:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:23,627 INFO L470 AbstractCegarLoop]: Abstraction has 1666 states and 3237 transitions. [2022-03-15 20:27:23,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 3237 transitions. [2022-03-15 20:27:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:23,628 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:23,628 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:23,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-15 20:27:23,628 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1804357991, now seen corresponding path program 11 times [2022-03-15 20:27:23,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:23,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447709085] [2022-03-15 20:27:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:24,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:24,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447709085] [2022-03-15 20:27:24,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447709085] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:24,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:24,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:27:24,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849257582] [2022-03-15 20:27:24,264 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:24,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:24,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 38 transitions. [2022-03-15 20:27:24,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:24,301 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:24,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:27:24,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:27:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:27:24,302 INFO L87 Difference]: Start difference. First operand 1666 states and 3237 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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:27:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:31,032 INFO L93 Difference]: Finished difference Result 3053 states and 5905 transitions. [2022-03-15 20:27:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 20:27:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:31,036 INFO L225 Difference]: With dead ends: 3053 [2022-03-15 20:27:31,036 INFO L226 Difference]: Without dead ends: 3053 [2022-03-15 20:27:31,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=874, Invalid=2666, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 20:27:31,036 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 363 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:31,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 423 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-03-15 20:27:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2022-03-15 20:27:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 1649. [2022-03-15 20:27:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1631 states have (on average 1.9638258736971184) internal successors, (3203), 1648 states have internal predecessors, (3203), 0 states have call successors, (0), 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:27:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 3203 transitions. [2022-03-15 20:27:31,059 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 3203 transitions. Word has length 36 [2022-03-15 20:27:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:31,059 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 3203 transitions. [2022-03-15 20:27:31,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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:27:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 3203 transitions. [2022-03-15 20:27:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:31,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:31,060 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:31,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-15 20:27:31,060 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 779955862, now seen corresponding path program 2 times [2022-03-15 20:27:31,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:31,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777487387] [2022-03-15 20:27:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:31,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:31,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777487387] [2022-03-15 20:27:31,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777487387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:31,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:31,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:27:31,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1906148180] [2022-03-15 20:27:31,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:31,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:31,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 36 transitions. [2022-03-15 20:27:31,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:31,586 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:31,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:27:31,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:27:31,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:27:31,587 INFO L87 Difference]: Start difference. First operand 1649 states and 3203 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:36,121 INFO L93 Difference]: Finished difference Result 2309 states and 4462 transitions. [2022-03-15 20:27:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:27:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:36,124 INFO L225 Difference]: With dead ends: 2309 [2022-03-15 20:27:36,124 INFO L226 Difference]: Without dead ends: 2309 [2022-03-15 20:27:36,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:27:36,124 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 311 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:36,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 197 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 20:27:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2022-03-15 20:27:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 1511. [2022-03-15 20:27:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1495 states have (on average 1.9518394648829431) internal successors, (2918), 1510 states have internal predecessors, (2918), 0 states have call successors, (0), 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:27:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2918 transitions. [2022-03-15 20:27:36,138 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2918 transitions. Word has length 36 [2022-03-15 20:27:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:36,138 INFO L470 AbstractCegarLoop]: Abstraction has 1511 states and 2918 transitions. [2022-03-15 20:27:36,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2918 transitions. [2022-03-15 20:27:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:36,139 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:36,139 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:36,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-15 20:27:36,140 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash -479445217, now seen corresponding path program 12 times [2022-03-15 20:27:36,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:36,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078776139] [2022-03-15 20:27:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:37,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:37,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078776139] [2022-03-15 20:27:37,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078776139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:37,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:37,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:37,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758501887] [2022-03-15 20:27:37,560 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:37,564 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:37,575 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 36 transitions. [2022-03-15 20:27:37,575 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:37,576 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:37,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:27:37,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:27:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:27:37,576 INFO L87 Difference]: Start difference. First operand 1511 states and 2918 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:43,675 INFO L93 Difference]: Finished difference Result 2065 states and 3985 transitions. [2022-03-15 20:27:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 20:27:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:43,678 INFO L225 Difference]: With dead ends: 2065 [2022-03-15 20:27:43,678 INFO L226 Difference]: Without dead ends: 2065 [2022-03-15 20:27:43,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=524, Invalid=1282, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:27:43,678 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 300 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:43,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 242 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:27:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2022-03-15 20:27:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1514. [2022-03-15 20:27:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1498 states have (on average 1.951935914552737) internal successors, (2924), 1513 states have internal predecessors, (2924), 0 states have call successors, (0), 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:27:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2924 transitions. [2022-03-15 20:27:43,693 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2924 transitions. Word has length 36 [2022-03-15 20:27:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:43,693 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2924 transitions. [2022-03-15 20:27:43,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2924 transitions. [2022-03-15 20:27:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:43,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:43,694 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:43,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-15 20:27:43,694 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -210678937, now seen corresponding path program 13 times [2022-03-15 20:27:43,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:43,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863865301] [2022-03-15 20:27:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:44,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:44,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863865301] [2022-03-15 20:27:44,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863865301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:44,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:44,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:44,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1639144562] [2022-03-15 20:27:44,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:44,511 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:44,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 42 transitions. [2022-03-15 20:27:44,523 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:44,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:44,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:27:44,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:27:44,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:27:44,584 INFO L87 Difference]: Start difference. First operand 1514 states and 2924 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:48,251 INFO L93 Difference]: Finished difference Result 2112 states and 4073 transitions. [2022-03-15 20:27:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:27:48,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:27:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:48,254 INFO L225 Difference]: With dead ends: 2112 [2022-03-15 20:27:48,254 INFO L226 Difference]: Without dead ends: 2112 [2022-03-15 20:27:48,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=681, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:27:48,255 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 283 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:48,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 233 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:27:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-03-15 20:27:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1502. [2022-03-15 20:27:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1486 states have (on average 1.952220726783311) internal successors, (2901), 1501 states have internal predecessors, (2901), 0 states have call successors, (0), 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:27:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2901 transitions. [2022-03-15 20:27:48,269 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2901 transitions. Word has length 36 [2022-03-15 20:27:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:48,269 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 2901 transitions. [2022-03-15 20:27:48,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2901 transitions. [2022-03-15 20:27:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:48,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:48,270 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:48,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-15 20:27:48,270 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1752630193, now seen corresponding path program 14 times [2022-03-15 20:27:48,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:48,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218817246] [2022-03-15 20:27:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:48,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:48,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218817246] [2022-03-15 20:27:48,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218817246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:48,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:48,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:48,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1879048419] [2022-03-15 20:27:48,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:48,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:48,969 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 36 transitions. [2022-03-15 20:27:48,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:48,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:48,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:27:48,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:48,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:27:48,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:27:48,970 INFO L87 Difference]: Start difference. First operand 1502 states and 2901 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:52,640 INFO L93 Difference]: Finished difference Result 2030 states and 3918 transitions. [2022-03-15 20:27:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:27:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:52,643 INFO L225 Difference]: With dead ends: 2030 [2022-03-15 20:27:52,643 INFO L226 Difference]: Without dead ends: 2030 [2022-03-15 20:27:52,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:27:52,644 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 277 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:52,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 248 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 20:27:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-03-15 20:27:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1497. [2022-03-15 20:27:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1481 states have (on average 1.9520594193112761) internal successors, (2891), 1496 states have internal predecessors, (2891), 0 states have call successors, (0), 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:27:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2891 transitions. [2022-03-15 20:27:52,670 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2891 transitions. Word has length 36 [2022-03-15 20:27:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:52,670 INFO L470 AbstractCegarLoop]: Abstraction has 1497 states and 2891 transitions. [2022-03-15 20:27:52,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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:27:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2891 transitions. [2022-03-15 20:27:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:52,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:52,671 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:52,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-15 20:27:52,672 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1829490973, now seen corresponding path program 15 times [2022-03-15 20:27:52,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:52,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033550867] [2022-03-15 20:27:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:53,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:53,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033550867] [2022-03-15 20:27:53,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033550867] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:53,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:53,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:53,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374731479] [2022-03-15 20:27:53,358 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:53,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:53,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 38 transitions. [2022-03-15 20:27:53,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:53,400 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:53,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:27:53,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:27:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:27:53,400 INFO L87 Difference]: Start difference. First operand 1497 states and 2891 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 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:27:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:57,627 INFO L93 Difference]: Finished difference Result 2047 states and 3950 transitions. [2022-03-15 20:27:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:27:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 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 36 [2022-03-15 20:27:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:57,629 INFO L225 Difference]: With dead ends: 2047 [2022-03-15 20:27:57,629 INFO L226 Difference]: Without dead ends: 2047 [2022-03-15 20:27:57,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:27:57,630 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 265 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:57,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 215 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:27:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2022-03-15 20:27:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1492. [2022-03-15 20:27:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1476 states have (on average 1.9518970189701896) internal successors, (2881), 1491 states have internal predecessors, (2881), 0 states have call successors, (0), 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:27:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2881 transitions. [2022-03-15 20:27:57,645 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2881 transitions. Word has length 36 [2022-03-15 20:27:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:57,645 INFO L470 AbstractCegarLoop]: Abstraction has 1492 states and 2881 transitions. [2022-03-15 20:27:57,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 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:27:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2881 transitions. [2022-03-15 20:27:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:27:57,646 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:57,646 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:27:57,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-15 20:27:57,646 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -55086513, now seen corresponding path program 16 times [2022-03-15 20:27:57,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:57,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731309060] [2022-03-15 20:27:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:58,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:58,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731309060] [2022-03-15 20:27:58,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731309060] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:58,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:58,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:58,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783932952] [2022-03-15 20:27:58,204 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:58,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:58,221 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 40 transitions. [2022-03-15 20:27:58,221 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:58,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:27:58,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:27:58,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:58,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:27:58,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:27:58,261 INFO L87 Difference]: Start difference. First operand 1492 states and 2881 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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:28:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:02,121 INFO L93 Difference]: Finished difference Result 2046 states and 3948 transitions. [2022-03-15 20:28:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:28:02,122 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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 36 [2022-03-15 20:28:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:02,124 INFO L225 Difference]: With dead ends: 2046 [2022-03-15 20:28:02,124 INFO L226 Difference]: Without dead ends: 2046 [2022-03-15 20:28:02,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:28:02,125 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 274 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:02,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 233 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 20:28:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-03-15 20:28:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1448. [2022-03-15 20:28:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1433 states have (on average 1.9518492672714585) internal successors, (2797), 1447 states have internal predecessors, (2797), 0 states have call successors, (0), 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:28:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2797 transitions. [2022-03-15 20:28:02,143 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2797 transitions. Word has length 36 [2022-03-15 20:28:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:02,143 INFO L470 AbstractCegarLoop]: Abstraction has 1448 states and 2797 transitions. [2022-03-15 20:28:02,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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:28:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2797 transitions. [2022-03-15 20:28:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:28:02,144 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:02,145 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:02,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-15 20:28:02,145 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1855585551, now seen corresponding path program 3 times [2022-03-15 20:28:02,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:02,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739550745] [2022-03-15 20:28:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:02,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:02,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739550745] [2022-03-15 20:28:02,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739550745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:02,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:02,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:28:02,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304526309] [2022-03-15 20:28:02,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:02,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:02,770 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 38 transitions. [2022-03-15 20:28:02,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:02,786 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [298572#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:28:02,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:28:02,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:28:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:28:02,787 INFO L87 Difference]: Start difference. First operand 1448 states and 2797 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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:28:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:05,463 INFO L93 Difference]: Finished difference Result 2147 states and 4145 transitions. [2022-03-15 20:28:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:28:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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 36 [2022-03-15 20:28:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:05,465 INFO L225 Difference]: With dead ends: 2147 [2022-03-15 20:28:05,465 INFO L226 Difference]: Without dead ends: 2147 [2022-03-15 20:28:05,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:28:05,466 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 264 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:05,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 174 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 20:28:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-03-15 20:28:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1436. [2022-03-15 20:28:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1421 states have (on average 1.951442646023927) internal successors, (2773), 1435 states have internal predecessors, (2773), 0 states have call successors, (0), 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:28:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2773 transitions. [2022-03-15 20:28:05,480 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2773 transitions. Word has length 36 [2022-03-15 20:28:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:05,480 INFO L470 AbstractCegarLoop]: Abstraction has 1436 states and 2773 transitions. [2022-03-15 20:28:05,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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:28:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2773 transitions. [2022-03-15 20:28:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:28:05,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:05,481 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:05,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-15 20:28:05,481 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -800113907, now seen corresponding path program 4 times [2022-03-15 20:28:05,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:05,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29788498] [2022-03-15 20:28:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:05,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:05,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29788498] [2022-03-15 20:28:05,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29788498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:05,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:05,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:28:05,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716334376] [2022-03-15 20:28:05,899 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:05,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:05,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 40 transitions. [2022-03-15 20:28:05,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:05,960 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [303625#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 303624#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)))] [2022-03-15 20:28:05,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:28:05,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:05,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:28:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:28:05,961 INFO L87 Difference]: Start difference. First operand 1436 states and 2773 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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:28:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:09,157 INFO L93 Difference]: Finished difference Result 2123 states and 4097 transitions. [2022-03-15 20:28:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:28:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 36 [2022-03-15 20:28:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:09,159 INFO L225 Difference]: With dead ends: 2123 [2022-03-15 20:28:09,159 INFO L226 Difference]: Without dead ends: 2123 [2022-03-15 20:28:09,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:28:09,160 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 277 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:09,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 174 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:28:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-03-15 20:28:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1424. [2022-03-15 20:28:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1409 states have (on average 1.951029098651526) internal successors, (2749), 1423 states have internal predecessors, (2749), 0 states have call successors, (0), 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:28:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2749 transitions. [2022-03-15 20:28:09,173 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2749 transitions. Word has length 36 [2022-03-15 20:28:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:09,174 INFO L470 AbstractCegarLoop]: Abstraction has 1424 states and 2749 transitions. [2022-03-15 20:28:09,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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:28:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2749 transitions. [2022-03-15 20:28:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:28:09,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:09,174 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:09,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-15 20:28:09,175 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1171205327, now seen corresponding path program 5 times [2022-03-15 20:28:09,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:09,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994656760] [2022-03-15 20:28:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:09,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:09,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:09,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994656760] [2022-03-15 20:28:09,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994656760] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:09,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:09,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:28:09,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32427618] [2022-03-15 20:28:09,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:09,962 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:09,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 42 transitions. [2022-03-15 20:28:09,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:10,077 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [308631#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= 1 |~#slot~0.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|)), 308632#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= 1 |~#slot~0.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|)), 308633#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= 1 |~#slot~0.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:28:10,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:10,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:10,078 INFO L87 Difference]: Start difference. First operand 1424 states and 2749 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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:28:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:14,770 INFO L93 Difference]: Finished difference Result 2079 states and 4009 transitions. [2022-03-15 20:28:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:28:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:28:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:14,773 INFO L225 Difference]: With dead ends: 2079 [2022-03-15 20:28:14,773 INFO L226 Difference]: Without dead ends: 2079 [2022-03-15 20:28:14,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:28:14,774 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 282 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:14,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 174 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 20:28:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2022-03-15 20:28:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1402. [2022-03-15 20:28:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1387 states have (on average 1.950252343186734) internal successors, (2705), 1401 states have internal predecessors, (2705), 0 states have call successors, (0), 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:28:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2705 transitions. [2022-03-15 20:28:14,788 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2705 transitions. Word has length 36 [2022-03-15 20:28:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:14,788 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 2705 transitions. [2022-03-15 20:28:14,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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:28:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2705 transitions. [2022-03-15 20:28:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 20:28:14,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:14,789 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:14,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-15 20:28:14,789 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1928289044, now seen corresponding path program 1 times [2022-03-15 20:28:14,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:14,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693459340] [2022-03-15 20:28:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:14,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:14,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693459340] [2022-03-15 20:28:14,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693459340] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:14,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:14,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:28:14,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436301645] [2022-03-15 20:28:14,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:14,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:14,983 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 37 transitions. [2022-03-15 20:28:14,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:14,984 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:28:14,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:28:14,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:28:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:28:14,985 INFO L87 Difference]: Start difference. First operand 1402 states and 2705 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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:28:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:17,308 INFO L93 Difference]: Finished difference Result 1375 states and 2652 transitions. [2022-03-15 20:28:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:28:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 37 [2022-03-15 20:28:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:17,309 INFO L225 Difference]: With dead ends: 1375 [2022-03-15 20:28:17,309 INFO L226 Difference]: Without dead ends: 1375 [2022-03-15 20:28:17,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:28:17,310 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:17,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 64 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:28:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2022-03-15 20:28:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2022-03-15 20:28:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1362 states have (on average 1.947136563876652) internal successors, (2652), 1374 states have internal predecessors, (2652), 0 states have call successors, (0), 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:28:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2652 transitions. [2022-03-15 20:28:17,321 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2652 transitions. Word has length 37 [2022-03-15 20:28:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:17,321 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 2652 transitions. [2022-03-15 20:28:17,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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:28:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2652 transitions. [2022-03-15 20:28:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:28:17,322 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:17,322 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:17,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-15 20:28:17,322 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 617395112, now seen corresponding path program 1 times [2022-03-15 20:28:17,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:17,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333463503] [2022-03-15 20:28:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:17,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:17,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333463503] [2022-03-15 20:28:17,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333463503] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:17,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:17,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:28:17,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1531602406] [2022-03-15 20:28:17,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:17,686 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:17,705 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 67 transitions. [2022-03-15 20:28:17,705 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:17,884 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [317686#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))] [2022-03-15 20:28:17,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:28:17,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:28:17,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:28:17,885 INFO L87 Difference]: Start difference. First operand 1375 states and 2652 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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:28:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:20,822 INFO L93 Difference]: Finished difference Result 1747 states and 3347 transitions. [2022-03-15 20:28:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:28:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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 41 [2022-03-15 20:28:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:20,825 INFO L225 Difference]: With dead ends: 1747 [2022-03-15 20:28:20,825 INFO L226 Difference]: Without dead ends: 1747 [2022-03-15 20:28:20,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:28:20,825 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 315 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:20,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 169 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 20:28:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-03-15 20:28:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1363. [2022-03-15 20:28:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1350 states have (on average 1.9466666666666668) internal successors, (2628), 1362 states have internal predecessors, (2628), 0 states have call successors, (0), 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:28:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2628 transitions. [2022-03-15 20:28:20,837 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2628 transitions. Word has length 41 [2022-03-15 20:28:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:20,838 INFO L470 AbstractCegarLoop]: Abstraction has 1363 states and 2628 transitions. [2022-03-15 20:28:20,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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:28:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2628 transitions. [2022-03-15 20:28:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:28:20,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:20,838 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:20,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-15 20:28:20,839 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 498013170, now seen corresponding path program 2 times [2022-03-15 20:28:20,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:20,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020343238] [2022-03-15 20:28:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:21,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:21,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020343238] [2022-03-15 20:28:21,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020343238] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:21,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:21,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:28:21,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627016599] [2022-03-15 20:28:21,487 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:21,493 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:21,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 69 transitions. [2022-03-15 20:28:21,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:21,658 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [322194#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:28:21,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:28:21,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:28:21,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:28:21,659 INFO L87 Difference]: Start difference. First operand 1363 states and 2628 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:28:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:24,798 INFO L93 Difference]: Finished difference Result 1738 states and 3329 transitions. [2022-03-15 20:28:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:28:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-03-15 20:28:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:24,800 INFO L225 Difference]: With dead ends: 1738 [2022-03-15 20:28:24,800 INFO L226 Difference]: Without dead ends: 1738 [2022-03-15 20:28:24,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:28:24,801 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 292 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:24,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 156 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:28:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2022-03-15 20:28:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1351. [2022-03-15 20:28:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1338 states have (on average 1.946188340807175) internal successors, (2604), 1350 states have internal predecessors, (2604), 0 states have call successors, (0), 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:28:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2604 transitions. [2022-03-15 20:28:24,828 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2604 transitions. Word has length 41 [2022-03-15 20:28:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:24,828 INFO L470 AbstractCegarLoop]: Abstraction has 1351 states and 2604 transitions. [2022-03-15 20:28:24,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:28:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2604 transitions. [2022-03-15 20:28:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:28:24,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:24,829 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:24,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-15 20:28:24,829 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash 798707466, now seen corresponding path program 3 times [2022-03-15 20:28:24,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:24,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998319043] [2022-03-15 20:28:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:25,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:25,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998319043] [2022-03-15 20:28:25,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998319043] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:25,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:25,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:28:25,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078108992] [2022-03-15 20:28:25,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:25,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:25,432 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 71 transitions. [2022-03-15 20:28:25,432 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:25,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [326669#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:28:25,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:28:25,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:28:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:28:25,604 INFO L87 Difference]: Start difference. First operand 1351 states and 2604 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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:28:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:29,389 INFO L93 Difference]: Finished difference Result 1669 states and 3191 transitions. [2022-03-15 20:28:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:28:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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 41 [2022-03-15 20:28:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:29,392 INFO L225 Difference]: With dead ends: 1669 [2022-03-15 20:28:29,392 INFO L226 Difference]: Without dead ends: 1669 [2022-03-15 20:28:29,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:28:29,392 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 271 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:29,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 163 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 20:28:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-03-15 20:28:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1302. [2022-03-15 20:28:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1289 states have (on average 1.9441427463149727) internal successors, (2506), 1301 states have internal predecessors, (2506), 0 states have call successors, (0), 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:28:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2506 transitions. [2022-03-15 20:28:29,404 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2506 transitions. Word has length 41 [2022-03-15 20:28:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:29,404 INFO L470 AbstractCegarLoop]: Abstraction has 1302 states and 2506 transitions. [2022-03-15 20:28:29,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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:28:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2506 transitions. [2022-03-15 20:28:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:29,405 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:29,405 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:29,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-15 20:28:29,405 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -521824882, now seen corresponding path program 1 times [2022-03-15 20:28:29,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:29,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615373751] [2022-03-15 20:28:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:30,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:30,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615373751] [2022-03-15 20:28:30,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615373751] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:30,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:30,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:30,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060768448] [2022-03-15 20:28:30,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:30,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:30,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 94 transitions. [2022-03-15 20:28:30,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:30,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [330999#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 331005#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 331003#(not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)), 330989#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 330996#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 330995#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 331002#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 330998#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 331008#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 330990#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 331001#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 331006#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 331007#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 330994#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 331004#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)), 330991#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 330992#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 330993#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)), 331000#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 330997#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 331009#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 331010#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))] [2022-03-15 20:28:30,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 20:28:30,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:30,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 20:28:30,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:28:30,914 INFO L87 Difference]: Start difference. First operand 1302 states and 2506 transitions. Second operand has 36 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:37,464 INFO L93 Difference]: Finished difference Result 2030 states and 3861 transitions. [2022-03-15 20:28:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:28:37,464 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 0 states have call successors, (0), 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 42 [2022-03-15 20:28:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:37,467 INFO L225 Difference]: With dead ends: 2030 [2022-03-15 20:28:37,467 INFO L226 Difference]: Without dead ends: 2030 [2022-03-15 20:28:37,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=531, Invalid=3009, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 20:28:37,467 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 778 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:37,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 316 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-03-15 20:28:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-03-15 20:28:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1392. [2022-03-15 20:28:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1379 states have (on average 1.9477882523567802) internal successors, (2686), 1391 states have internal predecessors, (2686), 0 states have call successors, (0), 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:28:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2686 transitions. [2022-03-15 20:28:37,485 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2686 transitions. Word has length 42 [2022-03-15 20:28:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:37,485 INFO L470 AbstractCegarLoop]: Abstraction has 1392 states and 2686 transitions. [2022-03-15 20:28:37,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 35 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2686 transitions. [2022-03-15 20:28:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:37,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:37,486 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:37,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-15 20:28:37,486 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1366217228, now seen corresponding path program 2 times [2022-03-15 20:28:37,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:37,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155010793] [2022-03-15 20:28:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:38,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:38,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155010793] [2022-03-15 20:28:38,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155010793] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:38,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:38,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:38,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207976583] [2022-03-15 20:28:38,171 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:38,177 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:38,223 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 100 transitions. [2022-03-15 20:28:38,224 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:39,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [335894#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 335888#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 335887#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)), 335895#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 335891#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 335893#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 335896#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 335889#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 335892#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 335897#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0))), 335890#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)))] [2022-03-15 20:28:39,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:28:39,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:28:39,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:28:39,072 INFO L87 Difference]: Start difference. First operand 1392 states and 2686 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 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:28:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:46,773 INFO L93 Difference]: Finished difference Result 1730 states and 3326 transitions. [2022-03-15 20:28:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:28:46,774 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 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 42 [2022-03-15 20:28:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:46,776 INFO L225 Difference]: With dead ends: 1730 [2022-03-15 20:28:46,776 INFO L226 Difference]: Without dead ends: 1730 [2022-03-15 20:28:46,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:28:46,776 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 269 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:46,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 291 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2748 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-03-15 20:28:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-03-15 20:28:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1393. [2022-03-15 20:28:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1380 states have (on average 1.9478260869565218) internal successors, (2688), 1392 states have internal predecessors, (2688), 0 states have call successors, (0), 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:28:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2688 transitions. [2022-03-15 20:28:46,788 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2688 transitions. Word has length 42 [2022-03-15 20:28:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:46,788 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 2688 transitions. [2022-03-15 20:28:46,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 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:28:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2688 transitions. [2022-03-15 20:28:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:46,789 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:46,789 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:46,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-15 20:28:46,789 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash -497828362, now seen corresponding path program 3 times [2022-03-15 20:28:46,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:46,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90915516] [2022-03-15 20:28:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:47,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:47,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90915516] [2022-03-15 20:28:47,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90915516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:47,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:47,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:47,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109365652] [2022-03-15 20:28:47,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:47,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:47,406 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 98 transitions. [2022-03-15 20:28:47,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:47,841 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [340466#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 340471#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 340462#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 340463#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 340470#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 340468#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 340472#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1), 340469#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 340465#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 340464#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 340467#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))] [2022-03-15 20:28:47,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:28:47,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:28:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:28:47,842 INFO L87 Difference]: Start difference. First operand 1393 states and 2688 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:54,010 INFO L93 Difference]: Finished difference Result 1712 states and 3292 transitions. [2022-03-15 20:28:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:28:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:54,013 INFO L225 Difference]: With dead ends: 1712 [2022-03-15 20:28:54,013 INFO L226 Difference]: Without dead ends: 1712 [2022-03-15 20:28:54,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:28:54,013 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 267 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:54,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 305 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-03-15 20:28:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-03-15 20:28:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1394. [2022-03-15 20:28:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1381 states have (on average 1.947863866763215) internal successors, (2690), 1393 states have internal predecessors, (2690), 0 states have call successors, (0), 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:28:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2690 transitions. [2022-03-15 20:28:54,040 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2690 transitions. Word has length 42 [2022-03-15 20:28:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:54,040 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2690 transitions. [2022-03-15 20:28:54,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2690 transitions. [2022-03-15 20:28:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:54,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:54,041 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:28:54,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-15 20:28:54,041 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1636099794, now seen corresponding path program 4 times [2022-03-15 20:28:54,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:54,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668428924] [2022-03-15 20:28:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:54,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:54,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668428924] [2022-03-15 20:28:54,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668428924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:54,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:54,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:54,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921477424] [2022-03-15 20:28:54,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:54,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:54,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 96 transitions. [2022-03-15 20:28:54,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:55,364 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [345020#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 345022#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 345019#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)), 345024#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 345028#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 345025#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4))), 345029#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0))), 345023#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 345026#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 345027#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 345021#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:28:55,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:28:55,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:28:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:28:55,365 INFO L87 Difference]: Start difference. First operand 1394 states and 2690 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:01,165 INFO L93 Difference]: Finished difference Result 1679 states and 3230 transitions. [2022-03-15 20:29:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:29:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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 42 [2022-03-15 20:29:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:01,167 INFO L225 Difference]: With dead ends: 1679 [2022-03-15 20:29:01,167 INFO L226 Difference]: Without dead ends: 1679 [2022-03-15 20:29:01,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:29:01,168 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 297 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:01,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 200 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 20:29:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-03-15 20:29:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1396. [2022-03-15 20:29:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1383 states have (on average 1.947939262472885) internal successors, (2694), 1395 states have internal predecessors, (2694), 0 states have call successors, (0), 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:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2694 transitions. [2022-03-15 20:29:01,179 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2694 transitions. Word has length 42 [2022-03-15 20:29:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:01,180 INFO L470 AbstractCegarLoop]: Abstraction has 1396 states and 2694 transitions. [2022-03-15 20:29:01,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2694 transitions. [2022-03-15 20:29:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:01,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:01,181 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:01,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-15 20:29:01,181 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1171041878, now seen corresponding path program 5 times [2022-03-15 20:29:01,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:01,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508040754] [2022-03-15 20:29:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:01,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:01,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508040754] [2022-03-15 20:29:01,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508040754] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:01,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:01,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:01,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940304863] [2022-03-15 20:29:01,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:01,815 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:01,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 94 transitions. [2022-03-15 20:29:01,840 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:02,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [349556#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 349553#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 349555#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 349557#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 349549#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 349551#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 349554#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 349558#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 349559#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 349552#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 349550#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:29:02,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:29:02,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:29:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:29:02,958 INFO L87 Difference]: Start difference. First operand 1396 states and 2694 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:09,069 INFO L93 Difference]: Finished difference Result 1919 states and 3697 transitions. [2022-03-15 20:29:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:29:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:29:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:09,072 INFO L225 Difference]: With dead ends: 1919 [2022-03-15 20:29:09,072 INFO L226 Difference]: Without dead ends: 1919 [2022-03-15 20:29:09,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:29:09,072 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 534 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:09,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 221 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-03-15 20:29:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-03-15 20:29:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1436. [2022-03-15 20:29:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1423 states have (on average 1.949402670414617) internal successors, (2774), 1435 states have internal predecessors, (2774), 0 states have call successors, (0), 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:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2774 transitions. [2022-03-15 20:29:09,085 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2774 transitions. Word has length 42 [2022-03-15 20:29:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:09,086 INFO L470 AbstractCegarLoop]: Abstraction has 1436 states and 2774 transitions. [2022-03-15 20:29:09,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2774 transitions. [2022-03-15 20:29:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:09,087 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:09,087 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:09,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-15 20:29:09,087 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2039430744, now seen corresponding path program 6 times [2022-03-15 20:29:09,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:09,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516511512] [2022-03-15 20:29:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:09,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:09,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:09,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516511512] [2022-03-15 20:29:09,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516511512] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:09,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:09,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:29:09,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131077317] [2022-03-15 20:29:09,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:09,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:09,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 92 transitions. [2022-03-15 20:29:09,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:10,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [354404#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)), 354406#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 354409#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 354412#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 354408#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 354411#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 354413#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 354410#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 354407#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 354414#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 354405#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:29:10,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:29:10,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:29:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:29:10,954 INFO L87 Difference]: Start difference. First operand 1436 states and 2774 transitions. Second operand has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:17,942 INFO L93 Difference]: Finished difference Result 1883 states and 3629 transitions. [2022-03-15 20:29:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:29:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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 42 [2022-03-15 20:29:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:17,944 INFO L225 Difference]: With dead ends: 1883 [2022-03-15 20:29:17,944 INFO L226 Difference]: Without dead ends: 1883 [2022-03-15 20:29:17,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=1522, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:29:17,945 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 440 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:17,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 294 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-03-15 20:29:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-03-15 20:29:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1441. [2022-03-15 20:29:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1428 states have (on average 1.949579831932773) internal successors, (2784), 1440 states have internal predecessors, (2784), 0 states have call successors, (0), 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:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2784 transitions. [2022-03-15 20:29:17,957 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2784 transitions. Word has length 42 [2022-03-15 20:29:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:17,957 INFO L470 AbstractCegarLoop]: Abstraction has 1441 states and 2784 transitions. [2022-03-15 20:29:17,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2784 transitions. [2022-03-15 20:29:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:17,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:17,958 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:17,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-15 20:29:17,958 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash -121608396, now seen corresponding path program 7 times [2022-03-15 20:29:17,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:17,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55598349] [2022-03-15 20:29:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:18,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:18,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55598349] [2022-03-15 20:29:18,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55598349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:18,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:18,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:18,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507741874] [2022-03-15 20:29:18,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:18,676 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:18,700 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 90 transitions. [2022-03-15 20:29:18,701 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:19,432 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [359234#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 359237#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 359231#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 359232#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 359239#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 359236#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 359230#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 359235#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 359233#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 359240#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 359238#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))))] [2022-03-15 20:29:19,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:29:19,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:19,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:29:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:29:19,433 INFO L87 Difference]: Start difference. First operand 1441 states and 2784 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 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,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:24,436 INFO L93 Difference]: Finished difference Result 1824 states and 3518 transitions. [2022-03-15 20:29:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:29:24,436 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 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 42 [2022-03-15 20:29:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:24,438 INFO L225 Difference]: With dead ends: 1824 [2022-03-15 20:29:24,438 INFO L226 Difference]: Without dead ends: 1824 [2022-03-15 20:29:24,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:29:24,439 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 547 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:24,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 254 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 20:29:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-03-15 20:29:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1447. [2022-03-15 20:29:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1434 states have (on average 1.9497907949790796) internal successors, (2796), 1446 states have internal predecessors, (2796), 0 states have call successors, (0), 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,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2796 transitions. [2022-03-15 20:29:24,453 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2796 transitions. Word has length 42 [2022-03-15 20:29:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:24,453 INFO L470 AbstractCegarLoop]: Abstraction has 1447 states and 2796 transitions. [2022-03-15 20:29:24,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 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,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2796 transitions. [2022-03-15 20:29:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:24,454 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:24,454 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:24,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-15 20:29:24,454 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1955620786, now seen corresponding path program 8 times [2022-03-15 20:29:24,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:24,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873198896] [2022-03-15 20:29:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:24,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 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 [873198896] [2022-03-15 20:29:25,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873198896] 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 [12] imperfect sequences [] total 12 [2022-03-15 20:29:25,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529385896] [2022-03-15 20:29:25,085 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:25,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:25,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 86 transitions. [2022-03-15 20:29:25,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:25,186 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:25,187 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2022-03-15 20:29:25,204 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:25,204 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:25,514 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:25,515 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:25,518 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:25,519 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2022-03-15 20:29:25,835 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:25,836 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-03-15 20:29:25,844 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:25,844 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:26,102 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:26,102 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:26,106 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:26,107 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2022-03-15 20:29:26,255 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:26,256 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:26,258 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:26,259 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:26,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [364013#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364019#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364022#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 364021#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 364015#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364020#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 364023#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 364016#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364011#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364018#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364014#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364017#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 364012#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:29:26,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:29:26,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:29:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:29:26,334 INFO L87 Difference]: Start difference. First operand 1447 states and 2796 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:33,425 INFO L93 Difference]: Finished difference Result 2425 states and 4660 transitions. [2022-03-15 20:29:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:29:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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 42 [2022-03-15 20:29:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:33,428 INFO L225 Difference]: With dead ends: 2425 [2022-03-15 20:29:33,428 INFO L226 Difference]: Without dead ends: 2425 [2022-03-15 20:29:33,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=491, Invalid=1959, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:29:33,429 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 571 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:33,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 282 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-03-15 20:29:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-03-15 20:29:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1412. [2022-03-15 20:29:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1399 states have (on average 1.9485346676197284) internal successors, (2726), 1411 states have internal predecessors, (2726), 0 states have call successors, (0), 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:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2726 transitions. [2022-03-15 20:29:33,445 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2726 transitions. Word has length 42 [2022-03-15 20:29:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:33,445 INFO L470 AbstractCegarLoop]: Abstraction has 1412 states and 2726 transitions. [2022-03-15 20:29:33,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2726 transitions. [2022-03-15 20:29:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:33,446 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:33,446 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:33,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-15 20:29:33,446 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1136032194, now seen corresponding path program 9 times [2022-03-15 20:29:33,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:33,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198064863] [2022-03-15 20:29:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:34,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:34,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198064863] [2022-03-15 20:29:34,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198064863] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:34,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:34,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:34,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1458762041] [2022-03-15 20:29:34,442 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:34,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:34,470 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 80 transitions. [2022-03-15 20:29:34,470 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:34,864 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:34,865 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 237 [2022-03-15 20:29:34,912 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:34,912 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:35,022 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,023 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 185 [2022-03-15 20:29:35,051 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,051 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:35,160 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,160 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:35,165 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,166 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2022-03-15 20:29:35,239 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,240 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-03-15 20:29:35,254 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,254 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:35,279 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,279 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:35,283 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:35,283 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:36,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [369333#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 369341#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |ULTIMATE.start_main_#t~mem49#1.base| 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 369338#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |ULTIMATE.start_main_#t~mem49#1.base| 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 369342#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 369343#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 369335#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 369337#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 369340#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |ULTIMATE.start_main_#t~mem49#1.base| 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 369334#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 369339#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |ULTIMATE.start_main_#t~mem49#1.base| 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 369336#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 369344#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0))] [2022-03-15 20:29:36,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:29:36,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:29:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:29:36,136 INFO L87 Difference]: Start difference. First operand 1412 states and 2726 transitions. Second operand has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:41,816 INFO L93 Difference]: Finished difference Result 1950 states and 3772 transitions. [2022-03-15 20:29:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:29:41,816 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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 42 [2022-03-15 20:29:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:41,819 INFO L225 Difference]: With dead ends: 1950 [2022-03-15 20:29:41,819 INFO L226 Difference]: Without dead ends: 1950 [2022-03-15 20:29:41,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:29:41,819 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 514 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:41,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 179 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-03-15 20:29:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2022-03-15 20:29:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1431. [2022-03-15 20:29:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1418 states have (on average 1.9492242595204514) internal successors, (2764), 1430 states have internal predecessors, (2764), 0 states have call successors, (0), 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:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2764 transitions. [2022-03-15 20:29:41,833 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2764 transitions. Word has length 42 [2022-03-15 20:29:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:41,833 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 2764 transitions. [2022-03-15 20:29:41,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 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:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2764 transitions. [2022-03-15 20:29:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:41,834 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:41,835 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:41,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-15 20:29:41,835 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash 92174140, now seen corresponding path program 10 times [2022-03-15 20:29:41,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:41,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136322812] [2022-03-15 20:29:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:41,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:42,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:42,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136322812] [2022-03-15 20:29:42,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136322812] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:42,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:42,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:42,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019511079] [2022-03-15 20:29:42,424 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:42,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:42,475 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 82 transitions. [2022-03-15 20:29:42,475 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:42,668 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,668 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 127 [2022-03-15 20:29:42,681 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,682 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:42,789 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,790 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2022-03-15 20:29:42,805 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,806 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:42,846 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,847 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:42,851 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,852 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2022-03-15 20:29:42,894 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,894 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:42,898 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:42,899 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2022-03-15 20:29:43,232 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:43,233 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:43,236 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:43,236 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:43,458 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [374208#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 374216#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 374217#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 374207#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 374212#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 374210#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 374214#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 374215#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 374211#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 374213#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 374218#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 374209#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:29:43,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:29:43,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:43,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:29:43,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:29:43,459 INFO L87 Difference]: Start difference. First operand 1431 states and 2764 transitions. Second operand has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:50,586 INFO L93 Difference]: Finished difference Result 1963 states and 3796 transitions. [2022-03-15 20:29:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:29:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:29:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:50,589 INFO L225 Difference]: With dead ends: 1963 [2022-03-15 20:29:50,589 INFO L226 Difference]: Without dead ends: 1963 [2022-03-15 20:29:50,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=1635, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:29:50,589 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 404 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:50,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 268 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-03-15 20:29:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-03-15 20:29:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1426. [2022-03-15 20:29:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1413 states have (on average 1.9490445859872612) internal successors, (2754), 1425 states have internal predecessors, (2754), 0 states have call successors, (0), 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:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2754 transitions. [2022-03-15 20:29:50,602 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2754 transitions. Word has length 42 [2022-03-15 20:29:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:50,602 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 2754 transitions. [2022-03-15 20:29:50,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2754 transitions. [2022-03-15 20:29:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:50,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:50,603 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:50,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-15 20:29:50,603 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1998454142, now seen corresponding path program 11 times [2022-03-15 20:29:50,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:50,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728669167] [2022-03-15 20:29:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:51,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:51,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728669167] [2022-03-15 20:29:51,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728669167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:51,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:51,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:51,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [243142542] [2022-03-15 20:29:51,328 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:51,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:51,364 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 84 transitions. [2022-03-15 20:29:51,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:51,580 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:51,581 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 184 [2022-03-15 20:29:51,612 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:51,612 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:51,725 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:51,725 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:51,732 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:51,733 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:29:51,943 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:51,944 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:29:51,964 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:51,964 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:52,151 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:52,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:52,157 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:52,157 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:29:52,719 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:52,720 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:52,723 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:52,723 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:52,918 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [379091#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 379089#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 379096#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 379097#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 379094#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 379098#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 379099#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 379093#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 379088#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 379095#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 379090#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 379092#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:29:52,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:29:52,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:29:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:29:52,919 INFO L87 Difference]: Start difference. First operand 1426 states and 2754 transitions. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 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:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:59,749 INFO L93 Difference]: Finished difference Result 2015 states and 3893 transitions. [2022-03-15 20:29:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:29:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 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 42 [2022-03-15 20:29:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:59,751 INFO L225 Difference]: With dead ends: 2015 [2022-03-15 20:29:59,751 INFO L226 Difference]: Without dead ends: 2015 [2022-03-15 20:29:59,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:29:59,752 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 449 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:59,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 229 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-03-15 20:29:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-03-15 20:29:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1421. [2022-03-15 20:29:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1408 states have (on average 1.9488636363636365) internal successors, (2744), 1420 states have internal predecessors, (2744), 0 states have call successors, (0), 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:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2744 transitions. [2022-03-15 20:29:59,765 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2744 transitions. Word has length 42 [2022-03-15 20:29:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:59,765 INFO L470 AbstractCegarLoop]: Abstraction has 1421 states and 2744 transitions. [2022-03-15 20:29:59,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 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:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2744 transitions. [2022-03-15 20:29:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:59,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:59,766 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:59,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-15 20:29:59,766 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 231568600, now seen corresponding path program 12 times [2022-03-15 20:29:59,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:59,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94850834] [2022-03-15 20:29:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:30:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:30:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:30:00,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:30:00,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94850834] [2022-03-15 20:30:00,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94850834] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:30:00,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:30:00,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:30:00,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557082175] [2022-03-15 20:30:00,781 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:30:00,787 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:30:00,810 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 82 transitions. [2022-03-15 20:30:00,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:30:01,058 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,059 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:01,063 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,064 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 182 [2022-03-15 20:30:01,146 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,147 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:01,151 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:30:01,205 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,206 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:30:01,217 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,218 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:01,847 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,848 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:30:01,859 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,859 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:01,884 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,885 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:30:01,888 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:01,888 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:02,077 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [384019#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 384020#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 384015#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 384017#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 384011#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 384021#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 384014#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 384016#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 384018#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 384010#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 384012#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 384013#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 384009#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:30:02,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:30:02,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:30:02,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:30:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:30:02,078 INFO L87 Difference]: Start difference. First operand 1421 states and 2744 transitions. Second operand has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 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:30:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:30:08,980 INFO L93 Difference]: Finished difference Result 1933 states and 3738 transitions. [2022-03-15 20:30:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:30:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 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 42 [2022-03-15 20:30:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:30:08,983 INFO L225 Difference]: With dead ends: 1933 [2022-03-15 20:30:08,983 INFO L226 Difference]: Without dead ends: 1933 [2022-03-15 20:30:08,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:30:08,983 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 402 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:30:08,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 177 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-03-15 20:30:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-03-15 20:30:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1430. [2022-03-15 20:30:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1417 states have (on average 1.9491884262526464) internal successors, (2762), 1429 states have internal predecessors, (2762), 0 states have call successors, (0), 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:30:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2762 transitions. [2022-03-15 20:30:08,996 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2762 transitions. Word has length 42 [2022-03-15 20:30:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:30:08,996 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 2762 transitions. [2022-03-15 20:30:08,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 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:30:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2762 transitions. [2022-03-15 20:30:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:30:08,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:30:08,997 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:30:08,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-15 20:30:08,997 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:30:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:30:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1459774934, now seen corresponding path program 13 times [2022-03-15 20:30:08,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:30:08,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624670911] [2022-03-15 20:30:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:30:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:30:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:30:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:30:09,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:30:09,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624670911] [2022-03-15 20:30:09,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624670911] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:30:09,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:30:09,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:30:09,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841001424] [2022-03-15 20:30:09,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:30:09,707 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:30:09,771 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 84 transitions. [2022-03-15 20:30:09,771 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:30:10,175 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,186 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:10,191 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,192 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 182 [2022-03-15 20:30:10,296 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,296 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:10,302 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,303 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:30:10,377 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,378 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:30:10,392 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,393 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:10,552 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,553 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:30:10,564 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,565 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:10,594 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,594 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:30:10,598 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:30:10,598 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:30:11,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [388871#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 388874#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 388870#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 388875#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 388873#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 388878#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 388876#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 388868#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 388872#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 388877#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 388879#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 388869#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0))] [2022-03-15 20:30:11,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:30:11,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:30:11,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:30:11,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:30:11,236 INFO L87 Difference]: Start difference. First operand 1430 states and 2762 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:30:13,605 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:30:14,806 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-15 20:30:14,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:30:14,819 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:30:14,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 20:30:14,820 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-15 20:30:14,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-15 20:30:14,820 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-03-15 20:30:14,821 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-15 20:30:14,821 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-15 20:30:14,821 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (11 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-15 20:30:14,822 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-15 20:30:14,823 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-15 20:30:14,823 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-15 20:30:14,824 INFO L732 BasicCegarLoop]: Path program histogram: [16, 14, 13, 5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:30:14,826 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:30:14,827 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:30:14,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:30:14 BasicIcfg [2022-03-15 20:30:14,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:30:14,845 INFO L158 Benchmark]: Toolchain (without parser) took 854021.76ms. Allocated memory was 192.9MB in the beginning and 836.8MB in the end (delta: 643.8MB). Free memory was 133.1MB in the beginning and 421.3MB in the end (delta: -288.3MB). Peak memory consumption was 356.6MB. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.93ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 132.9MB in the beginning and 177.3MB in the end (delta: -44.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.85ms. Allocated memory is still 231.7MB. Free memory was 176.8MB in the beginning and 172.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 INFO L158 Benchmark]: Boogie Preprocessor took 58.00ms. Allocated memory is still 231.7MB. Free memory was 172.6MB in the beginning and 169.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 INFO L158 Benchmark]: RCFGBuilder took 617.73ms. Allocated memory is still 231.7MB. Free memory was 169.0MB in the beginning and 140.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 INFO L158 Benchmark]: TraceAbstraction took 852755.86ms. Allocated memory was 231.7MB in the beginning and 836.8MB in the end (delta: 605.0MB). Free memory was 140.1MB in the beginning and 421.3MB in the end (delta: -281.2MB). Peak memory consumption was 324.9MB. Max. memory is 8.0GB. [2022-03-15 20:30:14,846 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.11ms. Allocated memory is still 192.9MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.93ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 132.9MB in the beginning and 177.3MB in the end (delta: -44.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.85ms. Allocated memory is still 231.7MB. Free memory was 176.8MB in the beginning and 172.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.00ms. Allocated memory is still 231.7MB. Free memory was 172.6MB in the beginning and 169.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 617.73ms. Allocated memory is still 231.7MB. Free memory was 169.0MB in the beginning and 140.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 852755.86ms. Allocated memory was 231.7MB in the beginning and 836.8MB in the end (delta: 605.0MB). Free memory was 140.1MB in the beginning and 421.3MB in the end (delta: -281.2MB). Peak memory consumption was 324.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 440.3s, 280 PlacesBefore, 84 PlacesAfterwards, 280 TransitionsBefore, 81 TransitionsAfterwards, 6512 CoEnabledTransitionPairs, 9 FixpointIterations, 186 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 259 TotalNumberOfCompositions, 45212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6788, positive: 5554, positive conditional: 0, positive unconditional: 5554, negative: 1234, negative conditional: 0, negative unconditional: 1234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2738, positive: 2612, positive conditional: 0, positive unconditional: 2612, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6788, positive: 2942, positive conditional: 0, positive unconditional: 2942, negative: 1108, negative conditional: 0, negative unconditional: 1108, unknown: 2738, unknown conditional: 0, unknown unconditional: 2738] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 97, Negative conditional cache size: 0, Negative unconditional cache size: 97 - 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 - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1265]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 366 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 852.6s, OverallIterations: 80, TraceHistogramMax: 10, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.1s, AutomataDifference: 313.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 440.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 22673 SdHoareTripleChecker+Valid, 286.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22673 mSDsluCounter, 14346 SdHoareTripleChecker+Invalid, 273.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1053 IncrementalHoareTripleChecker+Unchecked, 18766 mSDsCounter, 6436 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106248 IncrementalHoareTripleChecker+Invalid, 113743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6436 mSolverCounterUnsat, 3613 mSDtfsCounter, 106248 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3225 GetRequests, 952 SyntacticMatches, 112 SemanticMatches, 2161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18702 ImplicationChecksByTransitivity, 42.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1782occurred in iteration=49, InterpolantAutomatonStates: 1502, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 79 MinimizatonAttempts, 35852 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 20.9s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 2803 NumberOfCodeBlocks, 2764 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 2862 ConstructedInterpolants, 50 QuantifiedInterpolants, 47357 SizeOfPredicates, 60 NumberOfNonLiveVariables, 20909 ConjunctsInSsa, 405 ConjunctsInUnsatCore, 105 InterpolantComputations, 71 PerfectInterpolantSequences, 3506/4146 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: Timeout Completed graceful shutdown [2022-03-15 20:30:14,853 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process