/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.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/06-symbeq_05-funloop_hard2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 23:42:52,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:42:52,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:42:52,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:42:52,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:42:52,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:42:52,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:42:52,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:42:52,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:42:52,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:42:52,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:42:52,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:42:52,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:42:52,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:42:52,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:42:52,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:42:52,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:42:52,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:42:52,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:42:52,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:42:52,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:42:52,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:42:52,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:42:52,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:42:52,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:42:52,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:42:52,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:42:52,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:42:52,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:42:52,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:42:52,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:42:52,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:42:52,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:42:52,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:42:52,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:42:52,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:42:52,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:42:52,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:42:52,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:42:52,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:42:52,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:42:52,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 23:42:52,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:42:52,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:42:52,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:42:52,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:42:52,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:42:52,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:42:52,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:42:52,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:42:52,262 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:42:52,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:42:52,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:42:52,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:42:52,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:42:52,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:42:52,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:42:52,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:42:52,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:42:52,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:42:52,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:42:52,265 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:42:52,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:42:52,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 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-02-10 23:42:52,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:42:52,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:42:52,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:42:52,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:42:52,479 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:42:52,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-02-10 23:42:52,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b4617cc/986f3c1fece5409590e06912efe86935/FLAGef1efbd17 [2022-02-10 23:42:52,997 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:42:52,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-02-10 23:42:53,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b4617cc/986f3c1fece5409590e06912efe86935/FLAGef1efbd17 [2022-02-10 23:42:53,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b4617cc/986f3c1fece5409590e06912efe86935 [2022-02-10 23:42:53,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:42:53,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:42:53,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:42:53,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:42:53,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:42:53,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:42:53" (1/1) ... [2022-02-10 23:42:53,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7442863b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:53, skipping insertion in model container [2022-02-10 23:42:53,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:42:53" (1/1) ... [2022-02-10 23:42:53,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:42:53,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:42:54,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:42:54,036 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:42:54,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:42:54,142 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:42:54,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54 WrapperNode [2022-02-10 23:42:54,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:42:54,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:42:54,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:42:54,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:42:54,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,217 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-02-10 23:42:54,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:42:54,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:42:54,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:42:54,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:42:54,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:42:54,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:42:54,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:42:54,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:42:54,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (1/1) ... [2022-02-10 23:42:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:42:54,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:54,313 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-02-10 23:42:54,321 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-02-10 23:42:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:42:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:42:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:42:54,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:42:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-10 23:42:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 23:42:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-10 23:42:54,345 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-10 23:42:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:42:54,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:42:54,346 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:42:54,508 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:42:54,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:42:54,704 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:42:54,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:42:54,711 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-10 23:42:54,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:42:54 BoogieIcfgContainer [2022-02-10 23:42:54,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:42:54,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:42:54,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:42:54,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:42:54,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:42:53" (1/3) ... [2022-02-10 23:42:54,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316dc171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:42:54, skipping insertion in model container [2022-02-10 23:42:54,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:54" (2/3) ... [2022-02-10 23:42:54,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316dc171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:42:54, skipping insertion in model container [2022-02-10 23:42:54,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:42:54" (3/3) ... [2022-02-10 23:42:54,720 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-02-10 23:42:54,724 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:42:54,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:42:54,724 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-10 23:42:54,724 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:42:54,761 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,761 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,761 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,761 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,762 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,762 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,762 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,762 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,762 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,762 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,763 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,763 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,763 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,763 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,763 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,764 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,764 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,764 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,764 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,764 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,781 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,790 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,790 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,790 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,790 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,790 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,790 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,791 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,791 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,796 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,798 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,798 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,798 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,799 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,799 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,799 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,799 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,799 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,804 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,804 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,804 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,806 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,806 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,807 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,807 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,807 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,808 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,808 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:54,810 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 23:42:54,851 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:42:54,857 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 23:42:54,857 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-10 23:42:54,871 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 128 transitions, 261 flow [2022-02-10 23:42:54,970 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-10 23:42:54,989 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:54,989 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:54,990 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -88358338, now seen corresponding path program 1 times [2022-02-10 23:42:55,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:55,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470039161] [2022-02-10 23:42:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:55,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:55,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470039161] [2022-02-10 23:42:55,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470039161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:55,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:55,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:42:55,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271473738] [2022-02-10 23:42:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:55,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:42:55,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:42:55,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:42:55,248 INFO L87 Difference]: Start difference. First operand has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 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, 2 states have (on average 15.5) internal successors, (31), 2 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-02-10 23:42:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:55,303 INFO L93 Difference]: Finished difference Result 2321 states and 4620 transitions. [2022-02-10 23:42:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:42:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 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 31 [2022-02-10 23:42:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:55,338 INFO L225 Difference]: With dead ends: 2321 [2022-02-10 23:42:55,338 INFO L226 Difference]: Without dead ends: 2321 [2022-02-10 23:42:55,340 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02-10 23:42:55,343 INFO L934 BasicCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:55,344 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2022-02-10 23:42:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2022-02-10 23:42:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2307 states have (on average 2.0026007802340704) internal successors, (4620), 2320 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4620 transitions. [2022-02-10 23:42:55,477 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4620 transitions. Word has length 31 [2022-02-10 23:42:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:55,478 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4620 transitions. [2022-02-10 23:42:55,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 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-02-10 23:42:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4620 transitions. [2022-02-10 23:42:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-10 23:42:55,486 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:55,486 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:55,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:42:55,488 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:55,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash -932830209, now seen corresponding path program 1 times [2022-02-10 23:42:55,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:55,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986649651] [2022-02-10 23:42:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:55,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:55,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986649651] [2022-02-10 23:42:55,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986649651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:55,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:55,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:42:55,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253951636] [2022-02-10 23:42:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:55,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:42:55,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:42:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:42:55,572 INFO L87 Difference]: Start difference. First operand 2321 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-02-10 23:42:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:55,630 INFO L93 Difference]: Finished difference Result 2325 states and 4624 transitions. [2022-02-10 23:42:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:42:55,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 31 [2022-02-10 23:42:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:55,641 INFO L225 Difference]: With dead ends: 2325 [2022-02-10 23:42:55,641 INFO L226 Difference]: Without dead ends: 2325 [2022-02-10 23:42:55,642 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-10 23:42:55,643 INFO L934 BasicCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:55,645 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-02-10 23:42:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2322. [2022-02-10 23:42:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2308 states have (on average 2.002166377816291) internal successors, (4621), 2321 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4621 transitions. [2022-02-10 23:42:55,707 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4621 transitions. Word has length 31 [2022-02-10 23:42:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:55,707 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 4621 transitions. [2022-02-10 23:42:55,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-02-10 23:42:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4621 transitions. [2022-02-10 23:42:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-10 23:42:55,709 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:55,709 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:55,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:42:55,709 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 527090186, now seen corresponding path program 1 times [2022-02-10 23:42:55,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:55,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109810141] [2022-02-10 23:42:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:55,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:55,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109810141] [2022-02-10 23:42:55,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109810141] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:55,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104209577] [2022-02-10 23:42:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:55,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:55,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:55,828 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-02-10 23:42:55,858 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-02-10 23:42:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:55,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-10 23:42:55,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:42:55,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:55,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104209577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:55,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:55,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-10 23:42:55,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884722309] [2022-02-10 23:42:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:55,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:42:55,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:42:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:42:55,995 INFO L87 Difference]: Start difference. First operand 2322 states and 4621 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:56,055 INFO L93 Difference]: Finished difference Result 3432 states and 6841 transitions. [2022-02-10 23:42:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:42:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-02-10 23:42:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:56,069 INFO L225 Difference]: With dead ends: 3432 [2022-02-10 23:42:56,070 INFO L226 Difference]: Without dead ends: 3432 [2022-02-10 23:42:56,071 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:42:56,073 INFO L934 BasicCegarLoop]: 157 mSDtfsCounter, 66 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:56,074 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-02-10 23:42:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2359. [2022-02-10 23:42:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2345 states have (on average 2.002132196162047) internal successors, (4695), 2358 states have internal predecessors, (4695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4695 transitions. [2022-02-10 23:42:56,139 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4695 transitions. Word has length 36 [2022-02-10 23:42:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:56,139 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4695 transitions. [2022-02-10 23:42:56,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4695 transitions. [2022-02-10 23:42:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-10 23:42:56,143 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:56,143 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:56,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-10 23:42:56,361 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-02-10 23:42:56,361 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash -877434549, now seen corresponding path program 1 times [2022-02-10 23:42:56,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:56,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179815222] [2022-02-10 23:42:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:56,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:56,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179815222] [2022-02-10 23:42:56,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179815222] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:56,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288774331] [2022-02-10 23:42:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:56,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:56,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:56,444 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-02-10 23:42:56,467 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-02-10 23:42:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 23:42:56,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:56,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:56,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288774331] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:56,772 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:56,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 23:42:56,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640356082] [2022-02-10 23:42:56,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:56,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:56,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:56,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:42:56,779 INFO L87 Difference]: Start difference. First operand 2359 states and 4695 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:56,901 INFO L93 Difference]: Finished difference Result 2369 states and 4705 transitions. [2022-02-10 23:42:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:42:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 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 40 [2022-02-10 23:42:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:56,911 INFO L225 Difference]: With dead ends: 2369 [2022-02-10 23:42:56,911 INFO L226 Difference]: Without dead ends: 2369 [2022-02-10 23:42:56,912 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:42:56,914 INFO L934 BasicCegarLoop]: 119 mSDtfsCounter, 16 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:56,918 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 704 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:42:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-02-10 23:42:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-02-10 23:42:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2355 states have (on average 1.9978768577494692) internal successors, (4705), 2368 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4705 transitions. [2022-02-10 23:42:56,971 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4705 transitions. Word has length 40 [2022-02-10 23:42:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:56,972 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4705 transitions. [2022-02-10 23:42:56,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4705 transitions. [2022-02-10 23:42:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 23:42:56,973 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:56,973 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:56,996 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-02-10 23:42:57,189 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-02-10 23:42:57,189 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -198306197, now seen corresponding path program 2 times [2022-02-10 23:42:57,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:57,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088267994] [2022-02-10 23:42:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:57,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:57,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088267994] [2022-02-10 23:42:57,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088267994] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:57,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404909819] [2022-02-10 23:42:57,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:42:57,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:57,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:57,280 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-02-10 23:42:57,281 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-02-10 23:42:57,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:42:57,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:57,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-10 23:42:57,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:57,445 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 11 treesize of output 7 [2022-02-10 23:42:57,472 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-10 23:42:57,473 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 21 treesize of output 20 [2022-02-10 23:42:57,514 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-10 23:42:57,515 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 30 treesize of output 32 [2022-02-10 23:42:57,564 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-10 23:42:57,565 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 39 treesize of output 44 [2022-02-10 23:42:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-10 23:42:57,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:57,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404909819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:57,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:57,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-10 23:42:57,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650212252] [2022-02-10 23:42:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:57,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:42:57,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:42:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:42:57,589 INFO L87 Difference]: Start difference. First operand 2369 states and 4705 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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-02-10 23:42:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:57,793 INFO L93 Difference]: Finished difference Result 2638 states and 5243 transitions. [2022-02-10 23:42:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:42:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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 50 [2022-02-10 23:42:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:57,804 INFO L225 Difference]: With dead ends: 2638 [2022-02-10 23:42:57,805 INFO L226 Difference]: Without dead ends: 2638 [2022-02-10 23:42:57,805 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:42:57,805 INFO L934 BasicCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:57,806 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 479 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:42:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-02-10 23:42:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2502. [2022-02-10 23:42:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2488 states have (on average 1.9979903536977492) internal successors, (4971), 2501 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4971 transitions. [2022-02-10 23:42:57,861 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4971 transitions. Word has length 50 [2022-02-10 23:42:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:57,862 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 4971 transitions. [2022-02-10 23:42:57,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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-02-10 23:42:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4971 transitions. [2022-02-10 23:42:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-10 23:42:57,862 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:57,863 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:57,888 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-02-10 23:42:58,079 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-02-10 23:42:58,080 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 697598481, now seen corresponding path program 1 times [2022-02-10 23:42:58,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:58,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893317967] [2022-02-10 23:42:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:58,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:58,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893317967] [2022-02-10 23:42:58,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893317967] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:58,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997789410] [2022-02-10 23:42:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:58,204 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-02-10 23:42:58,205 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-02-10 23:42:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:58,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 23:42:58,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:58,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:58,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997789410] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:58,527 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:58,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-10 23:42:58,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106643675] [2022-02-10 23:42:58,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:58,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-10 23:42:58,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-10 23:42:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:42:58,529 INFO L87 Difference]: Start difference. First operand 2502 states and 4971 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:58,683 INFO L93 Difference]: Finished difference Result 2522 states and 4991 transitions. [2022-02-10 23:42:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 23:42:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 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 50 [2022-02-10 23:42:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:58,695 INFO L225 Difference]: With dead ends: 2522 [2022-02-10 23:42:58,696 INFO L226 Difference]: Without dead ends: 2522 [2022-02-10 23:42:58,696 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-02-10 23:42:58,697 INFO L934 BasicCegarLoop]: 119 mSDtfsCounter, 36 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:58,697 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 938 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-02-10 23:42:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-02-10 23:42:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2508 states have (on average 1.9900318979266347) internal successors, (4991), 2521 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4991 transitions. [2022-02-10 23:42:58,767 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4991 transitions. Word has length 50 [2022-02-10 23:42:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:58,767 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4991 transitions. [2022-02-10 23:42:58,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:42:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4991 transitions. [2022-02-10 23:42:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-10 23:42:58,769 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:58,770 INFO L515 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:58,797 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-02-10 23:42:58,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:58,992 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:42:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1015929775, now seen corresponding path program 2 times [2022-02-10 23:42:58,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:58,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433225513] [2022-02-10 23:42:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:59,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:59,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433225513] [2022-02-10 23:42:59,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433225513] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:59,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708627805] [2022-02-10 23:42:59,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:42:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:59,147 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-02-10 23:42:59,164 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-02-10 23:42:59,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:42:59,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:59,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-10 23:42:59,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:59,393 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 11 treesize of output 7 [2022-02-10 23:42:59,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,425 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 21 treesize of output 20 [2022-02-10 23:42:59,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:42:59,464 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-02-10 23:42:59,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:42:59,507 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:42:59,508 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 3 case distinctions, treesize of input 39 treesize of output 44 [2022-02-10 23:42:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-10 23:42:59,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:59,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708627805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:59,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:59,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-02-10 23:42:59,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566754213] [2022-02-10 23:42:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:59,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:59,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-02-10 23:42:59,539 INFO L87 Difference]: Start difference. First operand 2522 states and 4991 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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-02-10 23:43:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:00,158 INFO L93 Difference]: Finished difference Result 5451 states and 10849 transitions. [2022-02-10 23:43:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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 70 [2022-02-10 23:43:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:00,180 INFO L225 Difference]: With dead ends: 5451 [2022-02-10 23:43:00,180 INFO L226 Difference]: Without dead ends: 5451 [2022-02-10 23:43:00,181 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-02-10 23:43:00,181 INFO L934 BasicCegarLoop]: 359 mSDtfsCounter, 787 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:00,182 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 1022 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-02-10 23:43:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3341. [2022-02-10 23:43:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3327 states have (on average 1.9924857228734596) internal successors, (6629), 3340 states have internal predecessors, (6629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 6629 transitions. [2022-02-10 23:43:00,267 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 6629 transitions. Word has length 70 [2022-02-10 23:43:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:00,268 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 6629 transitions. [2022-02-10 23:43:00,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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-02-10 23:43:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 6629 transitions. [2022-02-10 23:43:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-10 23:43:00,269 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:00,269 INFO L515 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:00,293 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-02-10 23:43:00,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:00,486 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -177478757, now seen corresponding path program 1 times [2022-02-10 23:43:00,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:00,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379244912] [2022-02-10 23:43:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:00,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:00,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379244912] [2022-02-10 23:43:00,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379244912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:00,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701960193] [2022-02-10 23:43:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:00,640 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-02-10 23:43:00,665 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-02-10 23:43:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:00,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-10 23:43:00,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:00,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:43:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:01,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701960193] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:43:01,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:43:01,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-10 23:43:01,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726479380] [2022-02-10 23:43:01,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:43:01,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-10 23:43:01,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:01,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-10 23:43:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:01,119 INFO L87 Difference]: Start difference. First operand 3341 states and 6629 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:01,413 INFO L93 Difference]: Finished difference Result 3356 states and 6644 transitions. [2022-02-10 23:43:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 23:43:01,413 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 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 78 [2022-02-10 23:43:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:01,433 INFO L225 Difference]: With dead ends: 3356 [2022-02-10 23:43:01,433 INFO L226 Difference]: Without dead ends: 3356 [2022-02-10 23:43:01,434 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:43:01,434 INFO L934 BasicCegarLoop]: 119 mSDtfsCounter, 40 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:01,434 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 1058 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:43:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2022-02-10 23:43:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2022-02-10 23:43:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3342 states have (on average 1.988031119090365) internal successors, (6644), 3355 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 6644 transitions. [2022-02-10 23:43:01,493 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 6644 transitions. Word has length 78 [2022-02-10 23:43:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:01,494 INFO L470 AbstractCegarLoop]: Abstraction has 3356 states and 6644 transitions. [2022-02-10 23:43:01,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 6644 transitions. [2022-02-10 23:43:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-10 23:43:01,495 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:01,495 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:01,521 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-02-10 23:43:01,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:01,718 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 26007824, now seen corresponding path program 2 times [2022-02-10 23:43:01,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:01,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976959705] [2022-02-10 23:43:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:01,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:01,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976959705] [2022-02-10 23:43:01,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976959705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:01,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:01,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:43:01,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133371838] [2022-02-10 23:43:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:01,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:43:01,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:43:01,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:43:01,843 INFO L87 Difference]: Start difference. First operand 3356 states and 6644 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:01,980 INFO L93 Difference]: Finished difference Result 3594 states and 7120 transitions. [2022-02-10 23:43:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:43:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 93 [2022-02-10 23:43:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:01,990 INFO L225 Difference]: With dead ends: 3594 [2022-02-10 23:43:01,990 INFO L226 Difference]: Without dead ends: 3594 [2022-02-10 23:43:01,991 INFO L933 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-02-10 23:43:01,991 INFO L934 BasicCegarLoop]: 219 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:01,991 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 398 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:43:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-02-10 23:43:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3480. [2022-02-10 23:43:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3466 states have (on average 1.988459319099827) internal successors, (6892), 3479 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6892 transitions. [2022-02-10 23:43:02,053 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6892 transitions. Word has length 93 [2022-02-10 23:43:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:02,054 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6892 transitions. [2022-02-10 23:43:02,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6892 transitions. [2022-02-10 23:43:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-10 23:43:02,055 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:02,055 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:02,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 23:43:02,056 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash 360970443, now seen corresponding path program 1 times [2022-02-10 23:43:02,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:02,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672199086] [2022-02-10 23:43:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:02,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:02,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:02,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672199086] [2022-02-10 23:43:02,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672199086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:02,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:02,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:43:02,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723962086] [2022-02-10 23:43:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:02,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:43:02,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:43:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:43:02,152 INFO L87 Difference]: Start difference. First operand 3480 states and 6892 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:02,435 INFO L93 Difference]: Finished difference Result 3912 states and 7756 transitions. [2022-02-10 23:43:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:43:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 93 [2022-02-10 23:43:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:02,443 INFO L225 Difference]: With dead ends: 3912 [2022-02-10 23:43:02,443 INFO L226 Difference]: Without dead ends: 3912 [2022-02-10 23:43:02,443 INFO L933 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-02-10 23:43:02,444 INFO L934 BasicCegarLoop]: 274 mSDtfsCounter, 194 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:02,444 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 588 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2022-02-10 23:43:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3714. [2022-02-10 23:43:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3700 states have (on average 1.9891891891891893) internal successors, (7360), 3713 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7360 transitions. [2022-02-10 23:43:02,513 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7360 transitions. Word has length 93 [2022-02-10 23:43:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:02,514 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 7360 transitions. [2022-02-10 23:43:02,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7360 transitions. [2022-02-10 23:43:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:02,516 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:02,516 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:02,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 23:43:02,517 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1199640953, now seen corresponding path program 1 times [2022-02-10 23:43:02,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:02,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481080104] [2022-02-10 23:43:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:02,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:02,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481080104] [2022-02-10 23:43:02,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481080104] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:02,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845456432] [2022-02-10 23:43:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:02,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:02,970 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-02-10 23:43:02,971 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-02-10 23:43:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:03,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:03,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:03,326 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 13 treesize of output 9 [2022-02-10 23:43:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:03,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:03,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845456432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:03,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:03,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-10 23:43:03,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929912824] [2022-02-10 23:43:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:03,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:03,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:03,540 INFO L87 Difference]: Start difference. First operand 3714 states and 7360 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:04,040 INFO L93 Difference]: Finished difference Result 8247 states and 16407 transitions. [2022-02-10 23:43:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:04,059 INFO L225 Difference]: With dead ends: 8247 [2022-02-10 23:43:04,060 INFO L226 Difference]: Without dead ends: 8247 [2022-02-10 23:43:04,060 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-02-10 23:43:04,061 INFO L934 BasicCegarLoop]: 237 mSDtfsCounter, 635 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:04,061 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 1273 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-02-10 23:43:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 3900. [2022-02-10 23:43:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3900 states, 3886 states have (on average 1.9848172928461143) internal successors, (7713), 3899 states have internal predecessors, (7713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 7713 transitions. [2022-02-10 23:43:04,157 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 7713 transitions. Word has length 105 [2022-02-10 23:43:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:04,158 INFO L470 AbstractCegarLoop]: Abstraction has 3900 states and 7713 transitions. [2022-02-10 23:43:04,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 7713 transitions. [2022-02-10 23:43:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:04,160 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:04,160 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:04,186 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-02-10 23:43:04,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:04,374 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash -509932149, now seen corresponding path program 1 times [2022-02-10 23:43:04,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:04,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104100546] [2022-02-10 23:43:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:04,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:04,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104100546] [2022-02-10 23:43:04,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104100546] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:04,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505880484] [2022-02-10 23:43:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:04,653 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-02-10 23:43:04,663 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-02-10 23:43:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:04,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:04,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:05,017 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 13 treesize of output 9 [2022-02-10 23:43:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:05,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:05,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505880484] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:05,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:05,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:05,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835453056] [2022-02-10 23:43:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:05,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:05,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:05,124 INFO L87 Difference]: Start difference. First operand 3900 states and 7713 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:05,727 INFO L93 Difference]: Finished difference Result 9773 states and 19440 transitions. [2022-02-10 23:43:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:43:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:05,751 INFO L225 Difference]: With dead ends: 9773 [2022-02-10 23:43:05,751 INFO L226 Difference]: Without dead ends: 9773 [2022-02-10 23:43:05,752 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2022-02-10 23:43:05,752 INFO L934 BasicCegarLoop]: 252 mSDtfsCounter, 827 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:05,752 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1345 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2022-02-10 23:43:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 3903. [2022-02-10 23:43:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3889 states have (on average 1.9848290048855748) internal successors, (7719), 3902 states have internal predecessors, (7719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 7719 transitions. [2022-02-10 23:43:05,862 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 7719 transitions. Word has length 105 [2022-02-10 23:43:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:05,863 INFO L470 AbstractCegarLoop]: Abstraction has 3903 states and 7719 transitions. [2022-02-10 23:43:05,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 7719 transitions. [2022-02-10 23:43:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:05,865 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:05,865 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:05,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:06,079 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,SelfDestructingSolverStorable11 [2022-02-10 23:43:06,079 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1481321675, now seen corresponding path program 2 times [2022-02-10 23:43:06,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:06,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015036447] [2022-02-10 23:43:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:06,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:06,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015036447] [2022-02-10 23:43:06,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015036447] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:06,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548831378] [2022-02-10 23:43:06,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:06,322 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-02-10 23:43:06,349 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-02-10 23:43:06,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:06,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:06,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:06,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:06,734 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 13 treesize of output 9 [2022-02-10 23:43:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:06,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:06,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548831378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:06,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:06,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:06,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723616127] [2022-02-10 23:43:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:06,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:06,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:06,805 INFO L87 Difference]: Start difference. First operand 3903 states and 7719 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:07,568 INFO L93 Difference]: Finished difference Result 10247 states and 20388 transitions. [2022-02-10 23:43:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:07,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:07,598 INFO L225 Difference]: With dead ends: 10247 [2022-02-10 23:43:07,598 INFO L226 Difference]: Without dead ends: 10247 [2022-02-10 23:43:07,599 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-02-10 23:43:07,600 INFO L934 BasicCegarLoop]: 277 mSDtfsCounter, 1057 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:07,600 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 1473 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-02-10 23:43:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 3905. [2022-02-10 23:43:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 3891 states have (on average 1.9848368028784373) internal successors, (7723), 3904 states have internal predecessors, (7723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 7723 transitions. [2022-02-10 23:43:07,737 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 7723 transitions. Word has length 105 [2022-02-10 23:43:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:07,737 INFO L470 AbstractCegarLoop]: Abstraction has 3905 states and 7723 transitions. [2022-02-10 23:43:07,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 7723 transitions. [2022-02-10 23:43:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:07,740 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:07,740 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:07,767 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-02-10 23:43:07,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-10 23:43:07,964 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash 428011595, now seen corresponding path program 3 times [2022-02-10 23:43:07,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:07,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911004461] [2022-02-10 23:43:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:07,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:08,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:08,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911004461] [2022-02-10 23:43:08,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911004461] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:08,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569274607] [2022-02-10 23:43:08,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:08,114 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-02-10 23:43:08,116 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-02-10 23:43:08,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:08,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:08,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:08,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:08,483 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 13 treesize of output 9 [2022-02-10 23:43:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:08,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:08,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569274607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:08,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:08,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:08,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060743968] [2022-02-10 23:43:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:08,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:08,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:08,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:08,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:08,530 INFO L87 Difference]: Start difference. First operand 3905 states and 7723 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:09,720 INFO L93 Difference]: Finished difference Result 9750 states and 19370 transitions. [2022-02-10 23:43:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:09,748 INFO L225 Difference]: With dead ends: 9750 [2022-02-10 23:43:09,748 INFO L226 Difference]: Without dead ends: 9750 [2022-02-10 23:43:09,749 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:43:09,749 INFO L934 BasicCegarLoop]: 287 mSDtfsCounter, 1417 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:09,750 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1417 Valid, 1518 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2022-02-10 23:43:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 3925. [2022-02-10 23:43:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3911 states have (on average 1.9800562515980569) internal successors, (7744), 3924 states have internal predecessors, (7744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 7744 transitions. [2022-02-10 23:43:09,850 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 7744 transitions. Word has length 105 [2022-02-10 23:43:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:09,851 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 7744 transitions. [2022-02-10 23:43:09,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 7744 transitions. [2022-02-10 23:43:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:09,853 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:09,854 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:09,879 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-02-10 23:43:10,073 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,SelfDestructingSolverStorable13 [2022-02-10 23:43:10,074 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2091661697, now seen corresponding path program 4 times [2022-02-10 23:43:10,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:10,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487559607] [2022-02-10 23:43:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:10,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:10,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487559607] [2022-02-10 23:43:10,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487559607] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:10,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660300114] [2022-02-10 23:43:10,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:10,411 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-02-10 23:43:10,412 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-02-10 23:43:10,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:10,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:10,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:10,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:10,885 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 13 treesize of output 9 [2022-02-10 23:43:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:10,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:10,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660300114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:10,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:10,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:10,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252623013] [2022-02-10 23:43:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:10,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:10,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:10,943 INFO L87 Difference]: Start difference. First operand 3925 states and 7744 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:12,493 INFO L93 Difference]: Finished difference Result 13148 states and 26142 transitions. [2022-02-10 23:43:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:12,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:12,514 INFO L225 Difference]: With dead ends: 13148 [2022-02-10 23:43:12,514 INFO L226 Difference]: Without dead ends: 13148 [2022-02-10 23:43:12,517 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=1883, Unknown=0, NotChecked=0, Total=2256 [2022-02-10 23:43:12,518 INFO L934 BasicCegarLoop]: 359 mSDtfsCounter, 1484 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:12,518 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1932 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-10 23:43:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2022-02-10 23:43:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 3975. [2022-02-10 23:43:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-02-10 23:43:12,638 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-02-10 23:43:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:12,638 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-02-10 23:43:12,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-02-10 23:43:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:12,640 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:12,640 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:12,671 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-02-10 23:43:12,855 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,SelfDestructingSolverStorable14 [2022-02-10 23:43:12,855 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1656374657, now seen corresponding path program 5 times [2022-02-10 23:43:12,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:12,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869032516] [2022-02-10 23:43:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:13,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:13,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869032516] [2022-02-10 23:43:13,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869032516] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:13,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919127318] [2022-02-10 23:43:13,186 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:13,188 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-02-10 23:43:13,196 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-02-10 23:43:13,335 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:13,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:13,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:13,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:13,608 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 13 treesize of output 9 [2022-02-10 23:43:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:13,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:13,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919127318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:13,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:13,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:13,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354817149] [2022-02-10 23:43:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:13,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:13,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:13,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:13,676 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:14,442 INFO L93 Difference]: Finished difference Result 12864 states and 25565 transitions. [2022-02-10 23:43:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:14,462 INFO L225 Difference]: With dead ends: 12864 [2022-02-10 23:43:14,462 INFO L226 Difference]: Without dead ends: 12864 [2022-02-10 23:43:14,463 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 23:43:14,463 INFO L934 BasicCegarLoop]: 332 mSDtfsCounter, 1063 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:14,463 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 1809 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2022-02-10 23:43:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 3977. [2022-02-10 23:43:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3963 states have (on average 1.980317940953823) internal successors, (7848), 3976 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 7848 transitions. [2022-02-10 23:43:14,606 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 7848 transitions. Word has length 105 [2022-02-10 23:43:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:14,606 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 7848 transitions. [2022-02-10 23:43:14,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 7848 transitions. [2022-02-10 23:43:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:14,610 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:14,610 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:14,635 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-02-10 23:43:14,823 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,SelfDestructingSolverStorable15 [2022-02-10 23:43:14,823 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1169892031, now seen corresponding path program 6 times [2022-02-10 23:43:14,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:14,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145277474] [2022-02-10 23:43:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:15,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:15,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145277474] [2022-02-10 23:43:15,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145277474] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:15,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381262823] [2022-02-10 23:43:15,115 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:15,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:15,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:15,120 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-02-10 23:43:15,121 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-02-10 23:43:15,240 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:15,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:15,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:15,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:15,542 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 13 treesize of output 9 [2022-02-10 23:43:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:15,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:15,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381262823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:15,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:15,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:15,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240214793] [2022-02-10 23:43:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:15,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:15,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:15,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:15,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:15,583 INFO L87 Difference]: Start difference. First operand 3977 states and 7848 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:16,915 INFO L93 Difference]: Finished difference Result 13826 states and 27441 transitions. [2022-02-10 23:43:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:16,932 INFO L225 Difference]: With dead ends: 13826 [2022-02-10 23:43:16,933 INFO L226 Difference]: Without dead ends: 13826 [2022-02-10 23:43:16,933 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=1894, Unknown=0, NotChecked=0, Total=2256 [2022-02-10 23:43:16,934 INFO L934 BasicCegarLoop]: 379 mSDtfsCounter, 1305 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:16,934 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1305 Valid, 2006 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-02-10 23:43:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 3975. [2022-02-10 23:43:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-02-10 23:43:17,050 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-02-10 23:43:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:17,050 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-02-10 23:43:17,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-02-10 23:43:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:17,053 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:17,053 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:17,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:17,267 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,SelfDestructingSolverStorable16 [2022-02-10 23:43:17,267 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:17,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1363632863, now seen corresponding path program 7 times [2022-02-10 23:43:17,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:17,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755387635] [2022-02-10 23:43:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:17,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:17,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755387635] [2022-02-10 23:43:17,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755387635] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:17,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092813317] [2022-02-10 23:43:17,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:17,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:17,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:17,572 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-02-10 23:43:17,582 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-02-10 23:43:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:17,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:17,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:17,940 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 13 treesize of output 9 [2022-02-10 23:43:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:18,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:18,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092813317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:18,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:18,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:18,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611206858] [2022-02-10 23:43:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:18,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:18,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:18,042 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:18,554 INFO L93 Difference]: Finished difference Result 11072 states and 21976 transitions. [2022-02-10 23:43:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:43:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:18,571 INFO L225 Difference]: With dead ends: 11072 [2022-02-10 23:43:18,571 INFO L226 Difference]: Without dead ends: 11072 [2022-02-10 23:43:18,572 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-02-10 23:43:18,572 INFO L934 BasicCegarLoop]: 291 mSDtfsCounter, 797 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:18,572 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 1543 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2022-02-10 23:43:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 3978. [2022-02-10 23:43:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3964 states have (on average 1.9803229061553986) internal successors, (7850), 3977 states have internal predecessors, (7850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 7850 transitions. [2022-02-10 23:43:18,668 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 7850 transitions. Word has length 105 [2022-02-10 23:43:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:18,669 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 7850 transitions. [2022-02-10 23:43:18,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 7850 transitions. [2022-02-10 23:43:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:18,674 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:18,674 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:18,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:18,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:18,898 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -61562595, now seen corresponding path program 8 times [2022-02-10 23:43:18,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:18,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102863218] [2022-02-10 23:43:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:19,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:19,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102863218] [2022-02-10 23:43:19,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102863218] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:19,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568703170] [2022-02-10 23:43:19,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:19,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:19,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:19,157 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-02-10 23:43:19,157 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-02-10 23:43:19,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:19,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:19,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:19,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:19,574 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 13 treesize of output 9 [2022-02-10 23:43:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:19,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:19,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568703170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:19,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:19,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:19,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275820473] [2022-02-10 23:43:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:19,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:19,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:19,647 INFO L87 Difference]: Start difference. First operand 3978 states and 7850 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:20,556 INFO L93 Difference]: Finished difference Result 12770 states and 25348 transitions. [2022-02-10 23:43:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:20,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:20,576 INFO L225 Difference]: With dead ends: 12770 [2022-02-10 23:43:20,577 INFO L226 Difference]: Without dead ends: 12770 [2022-02-10 23:43:20,577 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 23:43:20,578 INFO L934 BasicCegarLoop]: 348 mSDtfsCounter, 931 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:20,578 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 1833 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2022-02-10 23:43:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 3980. [2022-02-10 23:43:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3966 states have (on average 1.9803328290468987) internal successors, (7854), 3979 states have internal predecessors, (7854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 7854 transitions. [2022-02-10 23:43:20,668 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 7854 transitions. Word has length 105 [2022-02-10 23:43:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:20,668 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 7854 transitions. [2022-02-10 23:43:20,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 7854 transitions. [2022-02-10 23:43:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:20,671 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:20,671 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:20,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-02-10 23:43:20,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:20,887 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1114872675, now seen corresponding path program 9 times [2022-02-10 23:43:20,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:20,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091380725] [2022-02-10 23:43:20,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:21,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:21,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091380725] [2022-02-10 23:43:21,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091380725] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:21,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83925486] [2022-02-10 23:43:21,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:21,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:21,095 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-02-10 23:43:21,103 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-02-10 23:43:21,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:21,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:21,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:21,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:21,496 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 13 treesize of output 9 [2022-02-10 23:43:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:21,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:21,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83925486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:21,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:21,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:21,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566972605] [2022-02-10 23:43:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:21,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:21,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:21,536 INFO L87 Difference]: Start difference. First operand 3980 states and 7854 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:22,699 INFO L93 Difference]: Finished difference Result 12273 states and 24330 transitions. [2022-02-10 23:43:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:22,717 INFO L225 Difference]: With dead ends: 12273 [2022-02-10 23:43:22,717 INFO L226 Difference]: Without dead ends: 12273 [2022-02-10 23:43:22,718 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:43:22,718 INFO L934 BasicCegarLoop]: 362 mSDtfsCounter, 1214 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:22,718 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1939 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2022-02-10 23:43:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 3975. [2022-02-10 23:43:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-02-10 23:43:22,805 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-02-10 23:43:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:22,806 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-02-10 23:43:22,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-02-10 23:43:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:22,808 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:22,808 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:22,834 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-02-10 23:43:23,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:23,024 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1959628071, now seen corresponding path program 10 times [2022-02-10 23:43:23,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:23,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074869008] [2022-02-10 23:43:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:23,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:23,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074869008] [2022-02-10 23:43:23,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074869008] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:23,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613157782] [2022-02-10 23:43:23,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:23,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:23,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:23,372 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:23,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-10 23:43:23,564 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:23,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:23,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:43:23,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:23,767 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 13 treesize of output 9 [2022-02-10 23:43:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:23,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:23,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613157782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:23,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:23,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-02-10 23:43:23,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630869819] [2022-02-10 23:43:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:23,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:43:23,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:43:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:23,859 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:24,454 INFO L93 Difference]: Finished difference Result 9102 states and 18079 transitions. [2022-02-10 23:43:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-10 23:43:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-02-10 23:43:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:24,466 INFO L225 Difference]: With dead ends: 9102 [2022-02-10 23:43:24,466 INFO L226 Difference]: Without dead ends: 9102 [2022-02-10 23:43:24,467 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 23:43:24,467 INFO L934 BasicCegarLoop]: 197 mSDtfsCounter, 747 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:24,467 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 1269 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-02-10 23:43:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 4050. [2022-02-10 23:43:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-02-10 23:43:24,537 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-02-10 23:43:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:24,537 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-02-10 23:43:24,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-02-10 23:43:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:24,540 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:24,540 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:24,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-02-10 23:43:24,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:24,755 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2128369343, now seen corresponding path program 11 times [2022-02-10 23:43:24,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:24,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351102545] [2022-02-10 23:43:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:25,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:25,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351102545] [2022-02-10 23:43:25,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351102545] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:25,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282385828] [2022-02-10 23:43:25,050 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:25,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:25,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:25,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:25,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-10 23:43:25,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:25,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:25,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:25,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:25,557 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 13 treesize of output 9 [2022-02-10 23:43:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:25,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:25,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282385828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:25,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:25,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:25,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837316870] [2022-02-10 23:43:25,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:25,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:25,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:25,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:25,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:25,606 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:26,558 INFO L93 Difference]: Finished difference Result 10156 states and 20144 transitions. [2022-02-10 23:43:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:43:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:26,570 INFO L225 Difference]: With dead ends: 10156 [2022-02-10 23:43:26,571 INFO L226 Difference]: Without dead ends: 10156 [2022-02-10 23:43:26,571 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 23:43:26,572 INFO L934 BasicCegarLoop]: 292 mSDtfsCounter, 1091 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:26,572 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1622 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2022-02-10 23:43:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 4050. [2022-02-10 23:43:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-02-10 23:43:26,640 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-02-10 23:43:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:26,640 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-02-10 23:43:26,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-02-10 23:43:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:26,643 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:26,643 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:26,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:26,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:26,859 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -16501203, now seen corresponding path program 12 times [2022-02-10 23:43:26,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:26,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364861666] [2022-02-10 23:43:26,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:26,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:27,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:27,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364861666] [2022-02-10 23:43:27,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364861666] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:27,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016598906] [2022-02-10 23:43:27,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:27,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:27,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:27,051 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:27,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-10 23:43:27,229 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:27,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:27,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:27,484 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 13 treesize of output 9 [2022-02-10 23:43:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:27,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:27,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016598906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:27,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:27,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:27,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165803935] [2022-02-10 23:43:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:27,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:27,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:27,529 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:28,595 INFO L93 Difference]: Finished difference Result 14218 states and 28225 transitions. [2022-02-10 23:43:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:28,615 INFO L225 Difference]: With dead ends: 14218 [2022-02-10 23:43:28,615 INFO L226 Difference]: Without dead ends: 14218 [2022-02-10 23:43:28,616 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 23:43:28,616 INFO L934 BasicCegarLoop]: 335 mSDtfsCounter, 1402 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:28,616 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1988 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2022-02-10 23:43:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 4054. [2022-02-10 23:43:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 4040 states have (on average 1.9806930693069307) internal successors, (8002), 4053 states have internal predecessors, (8002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 8002 transitions. [2022-02-10 23:43:28,702 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 8002 transitions. Word has length 105 [2022-02-10 23:43:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:28,702 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 8002 transitions. [2022-02-10 23:43:28,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 8002 transitions. [2022-02-10 23:43:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:28,704 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:28,704 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:28,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-02-10 23:43:28,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:28,905 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -563432145, now seen corresponding path program 13 times [2022-02-10 23:43:28,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:28,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338904443] [2022-02-10 23:43:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:29,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:29,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338904443] [2022-02-10 23:43:29,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338904443] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:29,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043186197] [2022-02-10 23:43:29,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:29,111 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:29,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-10 23:43:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:29,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:29,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:29,498 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 13 treesize of output 9 [2022-02-10 23:43:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:29,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:29,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043186197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:29,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:29,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:29,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552809458] [2022-02-10 23:43:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:29,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:29,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:29,554 INFO L87 Difference]: Start difference. First operand 4054 states and 8002 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:30,108 INFO L93 Difference]: Finished difference Result 9882 states and 19601 transitions. [2022-02-10 23:43:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:43:30,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:30,121 INFO L225 Difference]: With dead ends: 9882 [2022-02-10 23:43:30,122 INFO L226 Difference]: Without dead ends: 9882 [2022-02-10 23:43:30,122 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-02-10 23:43:30,123 INFO L934 BasicCegarLoop]: 299 mSDtfsCounter, 856 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:30,123 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 1470 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9882 states. [2022-02-10 23:43:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9882 to 4056. [2022-02-10 23:43:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4042 states have (on average 1.9807026224641266) internal successors, (8006), 4055 states have internal predecessors, (8006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-02-10 23:43:30,192 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-02-10 23:43:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:30,192 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-02-10 23:43:30,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-02-10 23:43:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:30,195 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:30,195 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:30,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-02-10 23:43:30,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-10 23:43:30,399 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1049914771, now seen corresponding path program 14 times [2022-02-10 23:43:30,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:30,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102447941] [2022-02-10 23:43:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:30,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:30,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102447941] [2022-02-10 23:43:30,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102447941] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:30,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352550400] [2022-02-10 23:43:30,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:30,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:30,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:30,676 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:30,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-10 23:43:30,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:30,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:30,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:30,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:31,095 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 13 treesize of output 9 [2022-02-10 23:43:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:31,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:31,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352550400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:31,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:31,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:31,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610506541] [2022-02-10 23:43:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:31,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:31,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:31,141 INFO L87 Difference]: Start difference. First operand 4056 states and 8006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:32,199 INFO L93 Difference]: Finished difference Result 10977 states and 21724 transitions. [2022-02-10 23:43:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:43:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:32,213 INFO L225 Difference]: With dead ends: 10977 [2022-02-10 23:43:32,213 INFO L226 Difference]: Without dead ends: 10977 [2022-02-10 23:43:32,214 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1456, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 23:43:32,214 INFO L934 BasicCegarLoop]: 346 mSDtfsCounter, 1081 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:32,214 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1081 Valid, 1915 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10977 states. [2022-02-10 23:43:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10977 to 4050. [2022-02-10 23:43:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-02-10 23:43:32,281 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-02-10 23:43:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:32,282 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-02-10 23:43:32,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-02-10 23:43:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:32,284 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:32,284 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:32,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:32,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-02-10 23:43:32,489 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -550224723, now seen corresponding path program 15 times [2022-02-10 23:43:32,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:32,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827523607] [2022-02-10 23:43:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:32,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:32,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827523607] [2022-02-10 23:43:32,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827523607] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:32,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117434294] [2022-02-10 23:43:32,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:32,759 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:32,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-10 23:43:32,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:32,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:32,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:32,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:33,269 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 13 treesize of output 9 [2022-02-10 23:43:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:33,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:33,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117434294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:33,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:33,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:33,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162938448] [2022-02-10 23:43:33,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:33,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:33,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:33,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:33,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:33,310 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:34,483 INFO L93 Difference]: Finished difference Result 12897 states and 25597 transitions. [2022-02-10 23:43:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 23:43:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:34,500 INFO L225 Difference]: With dead ends: 12897 [2022-02-10 23:43:34,500 INFO L226 Difference]: Without dead ends: 12897 [2022-02-10 23:43:34,500 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2022-02-10 23:43:34,501 INFO L934 BasicCegarLoop]: 345 mSDtfsCounter, 1626 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:34,501 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 1979 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2022-02-10 23:43:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 4060. [2022-02-10 23:43:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4046 states have (on average 1.9807217004448838) internal successors, (8014), 4059 states have internal predecessors, (8014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 8014 transitions. [2022-02-10 23:43:34,570 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 8014 transitions. Word has length 105 [2022-02-10 23:43:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:34,571 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 8014 transitions. [2022-02-10 23:43:34,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 8014 transitions. [2022-02-10 23:43:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:34,572 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:34,572 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:34,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-02-10 23:43:34,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-10 23:43:34,773 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:34,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1097155665, now seen corresponding path program 16 times [2022-02-10 23:43:34,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:34,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881064173] [2022-02-10 23:43:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:35,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:35,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881064173] [2022-02-10 23:43:35,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881064173] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:35,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655465737] [2022-02-10 23:43:35,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:35,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:35,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:35,031 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:35,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-10 23:43:35,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:35,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:35,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:43:35,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:35,414 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 13 treesize of output 9 [2022-02-10 23:43:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:35,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:35,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655465737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:35,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:35,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2022-02-10 23:43:35,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040580535] [2022-02-10 23:43:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:35,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:43:35,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:43:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-02-10 23:43:35,460 INFO L87 Difference]: Start difference. First operand 4060 states and 8014 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:36,427 INFO L93 Difference]: Finished difference Result 16275 states and 32325 transitions. [2022-02-10 23:43:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-10 23:43:36,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-02-10 23:43:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:36,449 INFO L225 Difference]: With dead ends: 16275 [2022-02-10 23:43:36,449 INFO L226 Difference]: Without dead ends: 16275 [2022-02-10 23:43:36,450 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 23:43:36,450 INFO L934 BasicCegarLoop]: 355 mSDtfsCounter, 1363 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:36,450 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 2184 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2022-02-10 23:43:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 4062. [2022-02-10 23:43:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4048 states have (on average 1.9807312252964426) internal successors, (8018), 4061 states have internal predecessors, (8018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 8018 transitions. [2022-02-10 23:43:36,543 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 8018 transitions. Word has length 105 [2022-02-10 23:43:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:36,543 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 8018 transitions. [2022-02-10 23:43:36,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 8018 transitions. [2022-02-10 23:43:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:36,544 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:36,545 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:36,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-02-10 23:43:36,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:36,745 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1583638291, now seen corresponding path program 17 times [2022-02-10 23:43:36,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:36,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301664736] [2022-02-10 23:43:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:37,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:37,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301664736] [2022-02-10 23:43:37,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301664736] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:37,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757115688] [2022-02-10 23:43:37,019 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:37,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:37,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:37,021 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:37,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-10 23:43:37,194 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:37,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:37,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:37,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:37,493 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 13 treesize of output 9 [2022-02-10 23:43:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:37,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:37,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757115688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:37,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:37,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:37,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896970280] [2022-02-10 23:43:37,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:37,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:37,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:37,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:37,545 INFO L87 Difference]: Start difference. First operand 4062 states and 8018 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:38,724 INFO L93 Difference]: Finished difference Result 13575 states and 26896 transitions. [2022-02-10 23:43:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 23:43:38,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:38,743 INFO L225 Difference]: With dead ends: 13575 [2022-02-10 23:43:38,743 INFO L226 Difference]: Without dead ends: 13575 [2022-02-10 23:43:38,744 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2022-02-10 23:43:38,744 INFO L934 BasicCegarLoop]: 384 mSDtfsCounter, 1337 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:38,744 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1337 Valid, 2129 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2022-02-10 23:43:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 4056. [2022-02-10 23:43:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4042 states have (on average 1.9807026224641266) internal successors, (8006), 4055 states have internal predecessors, (8006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-02-10 23:43:38,852 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-02-10 23:43:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:38,852 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-02-10 23:43:38,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-02-10 23:43:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:38,853 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:38,853 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:38,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-02-10 23:43:39,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-10 23:43:39,054 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1389897459, now seen corresponding path program 18 times [2022-02-10 23:43:39,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:39,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952218728] [2022-02-10 23:43:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:39,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:39,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952218728] [2022-02-10 23:43:39,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952218728] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:39,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066999228] [2022-02-10 23:43:39,234 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:39,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:39,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:39,235 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:39,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-10 23:43:39,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:39,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:39,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:39,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:39,609 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 13 treesize of output 9 [2022-02-10 23:43:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:39,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:39,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066999228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:39,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:39,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:39,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131815528] [2022-02-10 23:43:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:39,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:39,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:39,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:39,697 INFO L87 Difference]: Start difference. First operand 4056 states and 8006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:40,142 INFO L93 Difference]: Finished difference Result 8414 states and 16665 transitions. [2022-02-10 23:43:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:40,152 INFO L225 Difference]: With dead ends: 8414 [2022-02-10 23:43:40,152 INFO L226 Difference]: Without dead ends: 8414 [2022-02-10 23:43:40,152 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-02-10 23:43:40,153 INFO L934 BasicCegarLoop]: 268 mSDtfsCounter, 642 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:40,153 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 1493 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2022-02-10 23:43:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4059. [2022-02-10 23:43:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4045 states have (on average 1.980716934487021) internal successors, (8012), 4058 states have internal predecessors, (8012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 8012 transitions. [2022-02-10 23:43:40,211 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 8012 transitions. Word has length 105 [2022-02-10 23:43:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:40,212 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 8012 transitions. [2022-02-10 23:43:40,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 8012 transitions. [2022-02-10 23:43:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:40,213 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:40,213 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:40,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-02-10 23:43:40,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-02-10 23:43:40,414 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:40,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1479874379, now seen corresponding path program 19 times [2022-02-10 23:43:40,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:40,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553133323] [2022-02-10 23:43:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:40,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:40,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553133323] [2022-02-10 23:43:40,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553133323] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:40,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656804931] [2022-02-10 23:43:40,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:40,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:40,694 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:40,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-10 23:43:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:40,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:40,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:41,123 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 13 treesize of output 9 [2022-02-10 23:43:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:41,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:41,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656804931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:41,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:41,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:41,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91463323] [2022-02-10 23:43:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:41,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:41,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:41,185 INFO L87 Difference]: Start difference. First operand 4059 states and 8012 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:41,882 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2022-02-10 23:43:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:41,896 INFO L225 Difference]: With dead ends: 10112 [2022-02-10 23:43:41,896 INFO L226 Difference]: Without dead ends: 10112 [2022-02-10 23:43:41,897 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-02-10 23:43:41,897 INFO L934 BasicCegarLoop]: 325 mSDtfsCounter, 821 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:41,897 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 1682 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2022-02-10 23:43:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 4061. [2022-02-10 23:43:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 4047 states have (on average 1.9807264640474425) internal successors, (8016), 4060 states have internal predecessors, (8016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 8016 transitions. [2022-02-10 23:43:41,969 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 8016 transitions. Word has length 105 [2022-02-10 23:43:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:41,969 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 8016 transitions. [2022-02-10 23:43:41,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 8016 transitions. [2022-02-10 23:43:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:41,972 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:41,972 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:41,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:42,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:42,175 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 426564299, now seen corresponding path program 20 times [2022-02-10 23:43:42,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:42,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534267267] [2022-02-10 23:43:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:42,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:42,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534267267] [2022-02-10 23:43:42,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534267267] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:42,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404550229] [2022-02-10 23:43:42,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:42,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:42,429 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-10 23:43:42,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:42,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:42,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:42,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:42,843 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 13 treesize of output 9 [2022-02-10 23:43:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:42,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:42,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404550229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:42,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:42,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:42,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512246969] [2022-02-10 23:43:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:42,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:42,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:42,882 INFO L87 Difference]: Start difference. First operand 4061 states and 8016 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:44,013 INFO L93 Difference]: Finished difference Result 9615 states and 19019 transitions. [2022-02-10 23:43:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:43:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:44,024 INFO L225 Difference]: With dead ends: 9615 [2022-02-10 23:43:44,024 INFO L226 Difference]: Without dead ends: 9615 [2022-02-10 23:43:44,025 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 23:43:44,025 INFO L934 BasicCegarLoop]: 338 mSDtfsCounter, 1091 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:44,026 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1797 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2022-02-10 23:43:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 4050. [2022-02-10 23:43:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-02-10 23:43:44,091 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-02-10 23:43:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:44,091 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-02-10 23:43:44,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-02-10 23:43:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:44,093 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:44,093 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:44,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-02-10 23:43:44,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:44,294 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2124234257, now seen corresponding path program 21 times [2022-02-10 23:43:44,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:44,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487671449] [2022-02-10 23:43:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:44,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:44,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487671449] [2022-02-10 23:43:44,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487671449] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:44,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060919242] [2022-02-10 23:43:44,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:44,510 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-10 23:43:44,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:44,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:44,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:44,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:44,843 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 13 treesize of output 9 [2022-02-10 23:43:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:44,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:44,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060919242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:44,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:44,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:44,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049776226] [2022-02-10 23:43:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:44,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:44,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:44,959 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:45,519 INFO L93 Difference]: Finished difference Result 7878 states and 15626 transitions. [2022-02-10 23:43:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:45,528 INFO L225 Difference]: With dead ends: 7878 [2022-02-10 23:43:45,528 INFO L226 Difference]: Without dead ends: 7878 [2022-02-10 23:43:45,529 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:45,529 INFO L934 BasicCegarLoop]: 281 mSDtfsCounter, 827 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:45,529 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1648 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-02-10 23:43:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4086. [2022-02-10 23:43:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-02-10 23:43:45,601 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-02-10 23:43:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:45,602 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-02-10 23:43:45,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-02-10 23:43:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:45,603 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:45,603 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:45,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-02-10 23:43:45,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:45,804 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1798897081, now seen corresponding path program 22 times [2022-02-10 23:43:45,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:45,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313846067] [2022-02-10 23:43:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:46,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:46,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313846067] [2022-02-10 23:43:46,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313846067] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:46,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714397590] [2022-02-10 23:43:46,107 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:46,109 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:46,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-10 23:43:46,326 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:46,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:46,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:43:46,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:46,486 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 13 treesize of output 9 [2022-02-10 23:43:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:46,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:46,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714397590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:46,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:46,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-02-10 23:43:46,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998599753] [2022-02-10 23:43:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:46,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:43:46,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:43:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:46,561 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:47,501 INFO L93 Difference]: Finished difference Result 9039 states and 17934 transitions. [2022-02-10 23:43:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-10 23:43:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-02-10 23:43:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:47,517 INFO L225 Difference]: With dead ends: 9039 [2022-02-10 23:43:47,517 INFO L226 Difference]: Without dead ends: 9039 [2022-02-10 23:43:47,517 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 23:43:47,518 INFO L934 BasicCegarLoop]: 279 mSDtfsCounter, 1028 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:47,518 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 1612 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2022-02-10 23:43:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 4089. [2022-02-10 23:43:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 4075 states have (on average 1.9808588957055215) internal successors, (8072), 4088 states have internal predecessors, (8072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 8072 transitions. [2022-02-10 23:43:47,588 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 8072 transitions. Word has length 105 [2022-02-10 23:43:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:47,589 INFO L470 AbstractCegarLoop]: Abstraction has 4089 states and 8072 transitions. [2022-02-10 23:43:47,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 8072 transitions. [2022-02-10 23:43:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:47,590 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:47,590 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:47,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-02-10 23:43:47,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:47,791 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2005866963, now seen corresponding path program 23 times [2022-02-10 23:43:47,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:47,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987560685] [2022-02-10 23:43:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:48,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:48,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987560685] [2022-02-10 23:43:48,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987560685] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:48,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671963918] [2022-02-10 23:43:48,058 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:43:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:48,064 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:48,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-02-10 23:43:48,293 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:43:48,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:48,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:48,562 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 13 treesize of output 9 [2022-02-10 23:43:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:48,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:48,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671963918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:48,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:48,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:48,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602753606] [2022-02-10 23:43:48,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:48,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:48,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:48,600 INFO L87 Difference]: Start difference. First operand 4089 states and 8072 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:49,847 INFO L93 Difference]: Finished difference Result 9474 states and 18775 transitions. [2022-02-10 23:43:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:49,860 INFO L225 Difference]: With dead ends: 9474 [2022-02-10 23:43:49,860 INFO L226 Difference]: Without dead ends: 9474 [2022-02-10 23:43:49,861 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1876, Unknown=0, NotChecked=0, Total=2256 [2022-02-10 23:43:49,861 INFO L934 BasicCegarLoop]: 345 mSDtfsCounter, 1402 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:49,861 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1934 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2022-02-10 23:43:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 4086. [2022-02-10 23:43:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-02-10 23:43:49,925 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-02-10 23:43:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:49,925 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-02-10 23:43:49,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-02-10 23:43:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:49,927 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:49,927 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:49,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-02-10 23:43:50,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-02-10 23:43:50,127 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2128263501, now seen corresponding path program 24 times [2022-02-10 23:43:50,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:50,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403041789] [2022-02-10 23:43:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:50,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:50,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403041789] [2022-02-10 23:43:50,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403041789] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:50,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203085069] [2022-02-10 23:43:50,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:43:50,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:50,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:50,341 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:50,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-02-10 23:43:50,546 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:43:50,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:50,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:50,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:50,761 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 13 treesize of output 9 [2022-02-10 23:43:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:50,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:50,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203085069] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:50,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:50,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:43:50,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065685152] [2022-02-10 23:43:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:50,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:50,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:50,896 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:51,449 INFO L93 Difference]: Finished difference Result 8122 states and 16081 transitions. [2022-02-10 23:43:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:43:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:51,459 INFO L225 Difference]: With dead ends: 8122 [2022-02-10 23:43:51,460 INFO L226 Difference]: Without dead ends: 8122 [2022-02-10 23:43:51,460 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-02-10 23:43:51,460 INFO L934 BasicCegarLoop]: 316 mSDtfsCounter, 714 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:51,460 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 1686 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-02-10 23:43:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4095. [2022-02-10 23:43:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 4081 states have (on average 1.9808870374908112) internal successors, (8084), 4094 states have internal predecessors, (8084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 8084 transitions. [2022-02-10 23:43:51,518 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 8084 transitions. Word has length 105 [2022-02-10 23:43:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:51,519 INFO L470 AbstractCegarLoop]: Abstraction has 4095 states and 8084 transitions. [2022-02-10 23:43:51,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 8084 transitions. [2022-02-10 23:43:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:51,520 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:51,520 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:51,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-02-10 23:43:51,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:51,721 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1959733913, now seen corresponding path program 25 times [2022-02-10 23:43:51,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:51,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030833719] [2022-02-10 23:43:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:51,856 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:51,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030833719] [2022-02-10 23:43:51,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030833719] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:51,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670169456] [2022-02-10 23:43:51,856 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:43:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:51,858 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:51,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-02-10 23:43:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:52,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:52,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:52,339 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 13 treesize of output 9 [2022-02-10 23:43:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:52,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:52,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670169456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:52,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:52,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:52,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780921778] [2022-02-10 23:43:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:52,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:52,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:52,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:52,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:52,382 INFO L87 Difference]: Start difference. First operand 4095 states and 8084 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:53,496 INFO L93 Difference]: Finished difference Result 11081 states and 21956 transitions. [2022-02-10 23:43:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:43:53,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:53,544 INFO L225 Difference]: With dead ends: 11081 [2022-02-10 23:43:53,544 INFO L226 Difference]: Without dead ends: 11081 [2022-02-10 23:43:53,545 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 23:43:53,545 INFO L934 BasicCegarLoop]: 344 mSDtfsCounter, 1397 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:53,545 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 1899 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11081 states. [2022-02-10 23:43:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11081 to 4092. [2022-02-10 23:43:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-02-10 23:43:53,623 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-02-10 23:43:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:53,623 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-02-10 23:43:53,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-02-10 23:43:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:53,626 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:53,626 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:53,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:53,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:53,849 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash -185136633, now seen corresponding path program 26 times [2022-02-10 23:43:53,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:53,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409154974] [2022-02-10 23:43:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:53,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:53,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409154974] [2022-02-10 23:43:53,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409154974] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:53,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533478620] [2022-02-10 23:43:53,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:53,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:53,974 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:53,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-02-10 23:43:54,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:54,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:54,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:54,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:54,395 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 13 treesize of output 9 [2022-02-10 23:43:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:54,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:54,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533478620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:54,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:54,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:43:54,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843931674] [2022-02-10 23:43:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:54,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:54,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:54,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:54,432 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:55,663 INFO L93 Difference]: Finished difference Result 13372 states and 26547 transitions. [2022-02-10 23:43:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-10 23:43:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:55,683 INFO L225 Difference]: With dead ends: 13372 [2022-02-10 23:43:55,683 INFO L226 Difference]: Without dead ends: 13372 [2022-02-10 23:43:55,684 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2022-02-10 23:43:55,684 INFO L934 BasicCegarLoop]: 371 mSDtfsCounter, 1599 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:55,684 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 2049 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-02-10 23:43:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 4096. [2022-02-10 23:43:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4096 states, 4082 states have (on average 1.980891719745223) internal successors, (8086), 4095 states have internal predecessors, (8086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 8086 transitions. [2022-02-10 23:43:55,776 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 8086 transitions. Word has length 105 [2022-02-10 23:43:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:55,776 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 8086 transitions. [2022-02-10 23:43:55,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 8086 transitions. [2022-02-10 23:43:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:55,778 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:55,778 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:55,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-02-10 23:43:55,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-02-10 23:43:55,979 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash -732067575, now seen corresponding path program 27 times [2022-02-10 23:43:55,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:55,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728217743] [2022-02-10 23:43:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:56,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:56,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728217743] [2022-02-10 23:43:56,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728217743] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:56,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180655777] [2022-02-10 23:43:56,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:43:56,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:56,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:56,239 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:56,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-02-10 23:43:56,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:43:56,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:56,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:43:56,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:56,741 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 13 treesize of output 9 [2022-02-10 23:43:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:56,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:56,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180655777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:56,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:56,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:43:56,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326429519] [2022-02-10 23:43:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:56,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:56,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:56,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:56,798 INFO L87 Difference]: Start difference. First operand 4096 states and 8086 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:57,513 INFO L93 Difference]: Finished difference Result 9134 states and 18105 transitions. [2022-02-10 23:43:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-10 23:43:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:43:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:57,525 INFO L225 Difference]: With dead ends: 9134 [2022-02-10 23:43:57,525 INFO L226 Difference]: Without dead ends: 9134 [2022-02-10 23:43:57,526 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 23:43:57,526 INFO L934 BasicCegarLoop]: 335 mSDtfsCounter, 1087 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:57,526 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1762 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2022-02-10 23:43:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 4098. [2022-02-10 23:43:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4084 states have (on average 1.9809010773751223) internal successors, (8090), 4097 states have internal predecessors, (8090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8090 transitions. [2022-02-10 23:43:57,582 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8090 transitions. Word has length 105 [2022-02-10 23:43:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:57,582 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 8090 transitions. [2022-02-10 23:43:57,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:43:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8090 transitions. [2022-02-10 23:43:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:57,583 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:57,584 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:57,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-02-10 23:43:57,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-02-10 23:43:57,784 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1218550201, now seen corresponding path program 28 times [2022-02-10 23:43:57,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:57,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285560287] [2022-02-10 23:43:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:43:57,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:57,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285560287] [2022-02-10 23:43:57,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285560287] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:57,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181701788] [2022-02-10 23:43:57,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:43:57,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:57,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:57,895 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:57,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-10 23:43:58,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:43:58,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:58,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:43:58,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:58,370 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 13 treesize of output 9 [2022-02-10 23:43:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:58,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:58,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181701788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:58,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:58,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-02-10 23:43:58,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905118457] [2022-02-10 23:43:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:58,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:43:58,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:58,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:43:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:58,402 INFO L87 Difference]: Start difference. First operand 4098 states and 8090 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:59,544 INFO L93 Difference]: Finished difference Result 12493 states and 24756 transitions. [2022-02-10 23:43:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-10 23:43:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-02-10 23:43:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:59,561 INFO L225 Difference]: With dead ends: 12493 [2022-02-10 23:43:59,561 INFO L226 Difference]: Without dead ends: 12493 [2022-02-10 23:43:59,561 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 23:43:59,562 INFO L934 BasicCegarLoop]: 405 mSDtfsCounter, 1251 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:59,562 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 2202 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:43:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-02-10 23:43:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4086. [2022-02-10 23:43:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:43:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-02-10 23:43:59,632 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-02-10 23:43:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:59,632 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-02-10 23:43:59,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:43:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-02-10 23:43:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:43:59,633 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:59,633 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:59,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-02-10 23:43:59,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-02-10 23:43:59,834 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:43:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1585962891, now seen corresponding path program 29 times [2022-02-10 23:43:59,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:59,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919427759] [2022-02-10 23:43:59,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:59,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:00,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:00,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919427759] [2022-02-10 23:44:00,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919427759] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:00,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856158006] [2022-02-10 23:44:00,027 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:44:00,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:00,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:00,028 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:00,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-02-10 23:44:00,301 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:44:00,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:00,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:00,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:00,514 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 13 treesize of output 9 [2022-02-10 23:44:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:00,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:00,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856158006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:00,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:00,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:44:00,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251730145] [2022-02-10 23:44:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:00,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:00,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:00,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:44:00,604 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:01,075 INFO L93 Difference]: Finished difference Result 7570 states and 14977 transitions. [2022-02-10 23:44:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:44:01,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:01,084 INFO L225 Difference]: With dead ends: 7570 [2022-02-10 23:44:01,085 INFO L226 Difference]: Without dead ends: 7570 [2022-02-10 23:44:01,085 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-02-10 23:44:01,085 INFO L934 BasicCegarLoop]: 293 mSDtfsCounter, 611 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:01,085 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1626 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:44:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-02-10 23:44:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 4091. [2022-02-10 23:44:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4077 states have (on average 1.9808682855040471) internal successors, (8076), 4090 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-02-10 23:44:01,134 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-02-10 23:44:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:01,134 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-02-10 23:44:01,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-02-10 23:44:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:01,135 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:01,136 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:01,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-02-10 23:44:01,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-02-10 23:44:01,336 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1792932773, now seen corresponding path program 30 times [2022-02-10 23:44:01,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:01,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12840927] [2022-02-10 23:44:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:01,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12840927] [2022-02-10 23:44:01,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12840927] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515844360] [2022-02-10 23:44:01,451 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:44:01,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:01,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:01,453 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:01,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-02-10 23:44:01,648 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:44:01,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:01,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:01,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:01,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 13 treesize of output 9 [2022-02-10 23:44:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:01,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:01,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515844360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:01,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:01,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:44:01,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140095938] [2022-02-10 23:44:01,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:01,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:01,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:01,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:01,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:44:01,923 INFO L87 Difference]: Start difference. First operand 4091 states and 8076 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:02,942 INFO L93 Difference]: Finished difference Result 10529 states and 20852 transitions. [2022-02-10 23:44:02,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 23:44:02,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:02,958 INFO L225 Difference]: With dead ends: 10529 [2022-02-10 23:44:02,959 INFO L226 Difference]: Without dead ends: 10529 [2022-02-10 23:44:02,959 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 23:44:02,960 INFO L934 BasicCegarLoop]: 321 mSDtfsCounter, 1306 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:02,960 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1306 Valid, 1861 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:44:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2022-02-10 23:44:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 4088. [2022-02-10 23:44:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4074 states have (on average 1.9808541973490428) internal successors, (8070), 4087 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-02-10 23:44:03,079 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-02-10 23:44:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:03,080 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-02-10 23:44:03,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-02-10 23:44:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:03,082 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:03,082 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:03,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-02-10 23:44:03,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:03,295 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:03,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 357163977, now seen corresponding path program 31 times [2022-02-10 23:44:03,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:03,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100058534] [2022-02-10 23:44:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:03,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:03,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100058534] [2022-02-10 23:44:03,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100058534] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:03,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659120698] [2022-02-10 23:44:03,522 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:44:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:03,523 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:03,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-02-10 23:44:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:03,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:03,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:04,031 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 13 treesize of output 9 [2022-02-10 23:44:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:04,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:04,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659120698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:04,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:04,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:44:04,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758558397] [2022-02-10 23:44:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:04,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:04,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:44:04,070 INFO L87 Difference]: Start difference. First operand 4088 states and 8070 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:05,315 INFO L93 Difference]: Finished difference Result 14591 states and 28933 transitions. [2022-02-10 23:44:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 23:44:05,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:05,335 INFO L225 Difference]: With dead ends: 14591 [2022-02-10 23:44:05,335 INFO L226 Difference]: Without dead ends: 14591 [2022-02-10 23:44:05,336 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-02-10 23:44:05,336 INFO L934 BasicCegarLoop]: 376 mSDtfsCounter, 1598 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:05,337 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1598 Valid, 2220 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:44:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2022-02-10 23:44:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 4092. [2022-02-10 23:44:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-02-10 23:44:05,445 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-02-10 23:44:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:05,446 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-02-10 23:44:05,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-02-10 23:44:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:05,448 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:05,448 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:05,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-02-10 23:44:05,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-02-10 23:44:05,663 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash -189766965, now seen corresponding path program 32 times [2022-02-10 23:44:05,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:05,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232253922] [2022-02-10 23:44:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:05,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:05,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232253922] [2022-02-10 23:44:05,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232253922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:05,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708279367] [2022-02-10 23:44:05,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:44:05,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:05,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:05,908 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:05,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-02-10 23:44:06,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:44:06,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:06,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:06,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:06,349 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 13 treesize of output 9 [2022-02-10 23:44:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:06,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:06,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708279367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:06,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:06,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:44:06,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770157591] [2022-02-10 23:44:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:06,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:06,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:44:06,408 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:07,077 INFO L93 Difference]: Finished difference Result 10255 states and 20309 transitions. [2022-02-10 23:44:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:44:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:07,089 INFO L225 Difference]: With dead ends: 10255 [2022-02-10 23:44:07,089 INFO L226 Difference]: Without dead ends: 10255 [2022-02-10 23:44:07,090 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-02-10 23:44:07,090 INFO L934 BasicCegarLoop]: 340 mSDtfsCounter, 1018 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:07,090 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 1835 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:44:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-02-10 23:44:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 4094. [2022-02-10 23:44:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4080 states have (on average 1.9808823529411765) internal successors, (8082), 4093 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-02-10 23:44:07,153 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-02-10 23:44:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:07,153 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-02-10 23:44:07,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-02-10 23:44:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:07,155 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:07,155 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:07,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-02-10 23:44:07,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-02-10 23:44:07,356 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -676249591, now seen corresponding path program 33 times [2022-02-10 23:44:07,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:07,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097991240] [2022-02-10 23:44:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:07,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:07,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097991240] [2022-02-10 23:44:07,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097991240] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:07,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192787928] [2022-02-10 23:44:07,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:44:07,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:07,459 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:07,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-02-10 23:44:07,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:44:07,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:07,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:07,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:07,922 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 13 treesize of output 9 [2022-02-10 23:44:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:07,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:07,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192787928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:07,960 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:07,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-10 23:44:07,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365937638] [2022-02-10 23:44:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:07,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:07,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:44:07,962 INFO L87 Difference]: Start difference. First operand 4094 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:09,120 INFO L93 Difference]: Finished difference Result 11350 states and 22432 transitions. [2022-02-10 23:44:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-10 23:44:09,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:09,134 INFO L225 Difference]: With dead ends: 11350 [2022-02-10 23:44:09,134 INFO L226 Difference]: Without dead ends: 11350 [2022-02-10 23:44:09,134 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1195, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 23:44:09,135 INFO L934 BasicCegarLoop]: 387 mSDtfsCounter, 1219 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:09,135 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 2165 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:44:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2022-02-10 23:44:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 4082. [2022-02-10 23:44:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4068 states have (on average 1.980825958702065) internal successors, (8058), 4081 states have internal predecessors, (8058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 8058 transitions. [2022-02-10 23:44:09,215 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 8058 transitions. Word has length 105 [2022-02-10 23:44:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:09,216 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 8058 transitions. [2022-02-10 23:44:09,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 8058 transitions. [2022-02-10 23:44:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:09,217 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:09,217 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:09,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-02-10 23:44:09,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-02-10 23:44:09,418 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2113802281, now seen corresponding path program 34 times [2022-02-10 23:44:09,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:09,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900939359] [2022-02-10 23:44:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:09,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:09,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900939359] [2022-02-10 23:44:09,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900939359] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:09,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095811104] [2022-02-10 23:44:09,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:44:09,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:09,528 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:09,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-02-10 23:44:09,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:44:09,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:09,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-10 23:44:09,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:09,909 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 13 treesize of output 9 [2022-02-10 23:44:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:09,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:09,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095811104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:09,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:09,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-02-10 23:44:09,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402750184] [2022-02-10 23:44:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:09,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 23:44:09,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 23:44:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:44:09,938 INFO L87 Difference]: Start difference. First operand 4082 states and 8058 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:44:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:10,972 INFO L93 Difference]: Finished difference Result 15159 states and 30102 transitions. [2022-02-10 23:44:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 23:44:10,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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 105 [2022-02-10 23:44:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:10,992 INFO L225 Difference]: With dead ends: 15159 [2022-02-10 23:44:10,992 INFO L226 Difference]: Without dead ends: 15159 [2022-02-10 23:44:10,993 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2022-02-10 23:44:10,993 INFO L934 BasicCegarLoop]: 417 mSDtfsCounter, 1559 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:10,993 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 2491 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:44:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-02-10 23:44:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 4092. [2022-02-10 23:44:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-02-10 23:44:11,081 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-02-10 23:44:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:11,081 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-02-10 23:44:11,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-02-10 23:44:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-02-10 23:44:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:11,082 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:11,082 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:11,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-02-10 23:44:11,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:11,283 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1566871339, now seen corresponding path program 35 times [2022-02-10 23:44:11,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:11,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935488587] [2022-02-10 23:44:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:11,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:11,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935488587] [2022-02-10 23:44:11,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935488587] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:11,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810450954] [2022-02-10 23:44:11,543 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:44:11,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:11,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:11,544 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:11,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-02-10 23:44:11,829 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-10 23:44:11,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:11,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:11,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:12,063 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 13 treesize of output 9 [2022-02-10 23:44:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:12,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:12,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810450954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:12,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:12,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:44:12,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933794568] [2022-02-10 23:44:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:12,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:12,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:44:12,121 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:12,831 INFO L93 Difference]: Finished difference Result 12497 states and 24788 transitions. [2022-02-10 23:44:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:44:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:12,848 INFO L225 Difference]: With dead ends: 12497 [2022-02-10 23:44:12,848 INFO L226 Difference]: Without dead ends: 12497 [2022-02-10 23:44:12,848 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-02-10 23:44:12,849 INFO L934 BasicCegarLoop]: 350 mSDtfsCounter, 1045 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:12,849 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 1919 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:44:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-02-10 23:44:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 4094. [2022-02-10 23:44:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4080 states have (on average 1.9808823529411765) internal successors, (8082), 4093 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-02-10 23:44:12,924 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-02-10 23:44:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:12,924 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-02-10 23:44:12,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-02-10 23:44:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:12,926 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:12,926 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:12,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-02-10 23:44:13,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:13,126 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1080388713, now seen corresponding path program 36 times [2022-02-10 23:44:13,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:13,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109528477] [2022-02-10 23:44:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:13,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:13,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109528477] [2022-02-10 23:44:13,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109528477] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:13,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662598230] [2022-02-10 23:44:13,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:44:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:13,377 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:13,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-02-10 23:44:13,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-10 23:44:13,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:13,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:13,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:13,832 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 13 treesize of output 9 [2022-02-10 23:44:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:13,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:13,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662598230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:13,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:13,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:44:13,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286330765] [2022-02-10 23:44:13,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:13,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:13,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:44:13,871 INFO L87 Difference]: Start difference. First operand 4094 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:15,036 INFO L93 Difference]: Finished difference Result 13459 states and 26664 transitions. [2022-02-10 23:44:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 23:44:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:15,054 INFO L225 Difference]: With dead ends: 13459 [2022-02-10 23:44:15,054 INFO L226 Difference]: Without dead ends: 13459 [2022-02-10 23:44:15,054 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2022-02-10 23:44:15,055 INFO L934 BasicCegarLoop]: 397 mSDtfsCounter, 1335 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:15,055 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1335 Valid, 2209 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-10 23:44:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2022-02-10 23:44:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 4088. [2022-02-10 23:44:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4074 states have (on average 1.9808541973490428) internal successors, (8070), 4087 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-02-10 23:44:15,132 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-02-10 23:44:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:15,132 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-02-10 23:44:15,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-02-10 23:44:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:15,133 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:15,133 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:15,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-02-10 23:44:15,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-02-10 23:44:15,335 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1274129545, now seen corresponding path program 37 times [2022-02-10 23:44:15,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:15,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131614439] [2022-02-10 23:44:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:15,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:15,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131614439] [2022-02-10 23:44:15,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131614439] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:15,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103327330] [2022-02-10 23:44:15,511 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:44:15,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:15,512 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-02-10 23:44:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:15,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:15,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:15,949 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 13 treesize of output 9 [2022-02-10 23:44:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:16,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:16,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103327330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:16,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:16,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:44:16,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608136411] [2022-02-10 23:44:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:16,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:16,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:44:16,024 INFO L87 Difference]: Start difference. First operand 4088 states and 8070 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:16,482 INFO L93 Difference]: Finished difference Result 8298 states and 16433 transitions. [2022-02-10 23:44:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:44:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:16,493 INFO L225 Difference]: With dead ends: 8298 [2022-02-10 23:44:16,493 INFO L226 Difference]: Without dead ends: 8298 [2022-02-10 23:44:16,493 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-02-10 23:44:16,494 INFO L934 BasicCegarLoop]: 281 mSDtfsCounter, 656 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:16,495 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1447 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:44:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2022-02-10 23:44:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4091. [2022-02-10 23:44:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4077 states have (on average 1.9808682855040471) internal successors, (8076), 4090 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-02-10 23:44:16,578 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-02-10 23:44:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:16,578 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-02-10 23:44:16,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-02-10 23:44:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:16,580 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:16,580 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:16,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-02-10 23:44:16,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-02-10 23:44:16,796 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -151065913, now seen corresponding path program 38 times [2022-02-10 23:44:16,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:16,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090173294] [2022-02-10 23:44:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:17,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:17,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090173294] [2022-02-10 23:44:17,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090173294] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:17,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507895546] [2022-02-10 23:44:17,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:44:17,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:17,012 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:17,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-02-10 23:44:17,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:44:17,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:17,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:17,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:17,467 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 13 treesize of output 9 [2022-02-10 23:44:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:17,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:17,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507895546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:17,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:17,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-10 23:44:17,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317110572] [2022-02-10 23:44:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:17,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:17,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:44:17,526 INFO L87 Difference]: Start difference. First operand 4091 states and 8076 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:18,172 INFO L93 Difference]: Finished difference Result 9996 states and 19805 transitions. [2022-02-10 23:44:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:44:18,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:18,183 INFO L225 Difference]: With dead ends: 9996 [2022-02-10 23:44:18,183 INFO L226 Difference]: Without dead ends: 9996 [2022-02-10 23:44:18,184 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-02-10 23:44:18,184 INFO L934 BasicCegarLoop]: 338 mSDtfsCounter, 859 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:18,184 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1586 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:44:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-02-10 23:44:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 4093. [2022-02-10 23:44:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 4079 states have (on average 1.980877666094631) internal successors, (8080), 4092 states have internal predecessors, (8080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 8080 transitions. [2022-02-10 23:44:18,245 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 8080 transitions. Word has length 105 [2022-02-10 23:44:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:18,246 INFO L470 AbstractCegarLoop]: Abstraction has 4093 states and 8080 transitions. [2022-02-10 23:44:18,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 8080 transitions. [2022-02-10 23:44:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-10 23:44:18,247 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:18,247 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:44:18,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-02-10 23:44:18,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-02-10 23:44:18,448 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1204375993, now seen corresponding path program 39 times [2022-02-10 23:44:18,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:18,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987152798] [2022-02-10 23:44:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-02-10 23:44:18,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:18,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987152798] [2022-02-10 23:44:18,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987152798] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:18,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690131393] [2022-02-10 23:44:18,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:44:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:18,607 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:18,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-02-10 23:44:18,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-10 23:44:18,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:18,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-10 23:44:18,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:19,099 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 13 treesize of output 9 [2022-02-10 23:44:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:19,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:44:19,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690131393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:19,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:44:19,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-10 23:44:19,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354837444] [2022-02-10 23:44:19,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:19,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:19,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:19,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:44:19,135 INFO L87 Difference]: Start difference. First operand 4093 states and 8080 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:20,093 INFO L93 Difference]: Finished difference Result 9499 states and 18787 transitions. [2022-02-10 23:44:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-10 23:44:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 105 [2022-02-10 23:44:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:20,105 INFO L225 Difference]: With dead ends: 9499 [2022-02-10 23:44:20,105 INFO L226 Difference]: Without dead ends: 9499 [2022-02-10 23:44:20,105 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 23:44:20,106 INFO L934 BasicCegarLoop]: 352 mSDtfsCounter, 1102 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:20,106 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 1703 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:44:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2022-02-10 23:44:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 4073. [2022-02-10 23:44:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4059 states have (on average 1.9807834441980783) internal successors, (8040), 4072 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 8040 transitions. [2022-02-10 23:44:20,163 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 8040 transitions. Word has length 105 [2022-02-10 23:44:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:20,163 INFO L470 AbstractCegarLoop]: Abstraction has 4073 states and 8040 transitions. [2022-02-10 23:44:20,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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-02-10 23:44:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 8040 transitions. [2022-02-10 23:44:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:44:20,164 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:20,164 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 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-02-10 23:44:20,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-02-10 23:44:20,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:20,365 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1890126863, now seen corresponding path program 1 times [2022-02-10 23:44:20,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:20,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577823812] [2022-02-10 23:44:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:20,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:20,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577823812] [2022-02-10 23:44:20,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577823812] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:20,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875781973] [2022-02-10 23:44:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:20,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:20,402 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:20,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-02-10 23:44:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:20,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 23:44:20,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:20,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:20,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875781973] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:20,977 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:20,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 23:44:20,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261739710] [2022-02-10 23:44:20,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:20,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:44:20,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:44:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:44:20,978 INFO L87 Difference]: Start difference. First operand 4073 states and 8040 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:21,036 INFO L93 Difference]: Finished difference Result 7477 states and 14848 transitions. [2022-02-10 23:44:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:44:21,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 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 110 [2022-02-10 23:44:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:21,045 INFO L225 Difference]: With dead ends: 7477 [2022-02-10 23:44:21,045 INFO L226 Difference]: Without dead ends: 7477 [2022-02-10 23:44:21,045 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:44:21,045 INFO L934 BasicCegarLoop]: 197 mSDtfsCounter, 496 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:21,046 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 1111 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:44:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-02-10 23:44:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7321. [2022-02-10 23:44:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 7307 states have (on average 2.0106746954974684) internal successors, (14692), 7320 states have internal predecessors, (14692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 14692 transitions. [2022-02-10 23:44:21,127 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 14692 transitions. Word has length 110 [2022-02-10 23:44:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:21,127 INFO L470 AbstractCegarLoop]: Abstraction has 7321 states and 14692 transitions. [2022-02-10 23:44:21,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 14692 transitions. [2022-02-10 23:44:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-10 23:44:21,128 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:21,128 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:44:21,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-02-10 23:44:21,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:21,329 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -621139911, now seen corresponding path program 1 times [2022-02-10 23:44:21,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:21,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313549934] [2022-02-10 23:44:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-02-10 23:44:21,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:21,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313549934] [2022-02-10 23:44:21,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313549934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:44:21,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:44:21,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:44:21,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221476697] [2022-02-10 23:44:21,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:44:21,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:44:21,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:21,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:44:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:44:21,409 INFO L87 Difference]: Start difference. First operand 7321 states and 14692 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 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-02-10 23:44:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:21,587 INFO L93 Difference]: Finished difference Result 8193 states and 16446 transitions. [2022-02-10 23:44:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:44:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 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 114 [2022-02-10 23:44:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:21,597 INFO L225 Difference]: With dead ends: 8193 [2022-02-10 23:44:21,598 INFO L226 Difference]: Without dead ends: 7610 [2022-02-10 23:44:21,598 INFO L933 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-02-10 23:44:21,598 INFO L934 BasicCegarLoop]: 272 mSDtfsCounter, 200 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:21,598 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 509 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:44:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-02-10 23:44:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6942. [2022-02-10 23:44:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6942 states, 6929 states have (on average 2.012122961466301) internal successors, (13942), 6941 states have internal predecessors, (13942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 13942 transitions. [2022-02-10 23:44:21,702 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 13942 transitions. Word has length 114 [2022-02-10 23:44:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:21,702 INFO L470 AbstractCegarLoop]: Abstraction has 6942 states and 13942 transitions. [2022-02-10 23:44:21,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 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-02-10 23:44:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 13942 transitions. [2022-02-10 23:44:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:21,705 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:21,705 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:44:21,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-10 23:44:21,705 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash 278963169, now seen corresponding path program 1 times [2022-02-10 23:44:21,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:21,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135960916] [2022-02-10 23:44:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:22,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:22,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135960916] [2022-02-10 23:44:22,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135960916] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:22,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590696031] [2022-02-10 23:44:22,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:22,002 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-02-10 23:44:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:22,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-10 23:44:22,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:23,059 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 11 treesize of output 7 [2022-02-10 23:44:23,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,099 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 21 treesize of output 20 [2022-02-10 23:44:23,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,156 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 30 treesize of output 32 [2022-02-10 23:44:23,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,226 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 39 treesize of output 44 [2022-02-10 23:44:23,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:23,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-10 23:44:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:23,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:23,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:23,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:24,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590696031] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:24,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:24,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-10 23:44:24,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425966822] [2022-02-10 23:44:24,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:24,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 23:44:24,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 23:44:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:44:24,575 INFO L87 Difference]: Start difference. First operand 6942 states and 13942 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:29,199 INFO L93 Difference]: Finished difference Result 16196 states and 32438 transitions. [2022-02-10 23:44:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-10 23:44:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-02-10 23:44:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:29,227 INFO L225 Difference]: With dead ends: 16196 [2022-02-10 23:44:29,227 INFO L226 Difference]: Without dead ends: 16152 [2022-02-10 23:44:29,228 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1235, Invalid=5905, Unknown=0, NotChecked=0, Total=7140 [2022-02-10 23:44:29,228 INFO L934 BasicCegarLoop]: 400 mSDtfsCounter, 3300 mSDsluCounter, 4833 mSDsCounter, 0 mSdLazyCounter, 5396 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3300 SdHoareTripleChecker+Valid, 5232 SdHoareTripleChecker+Invalid, 6623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 5396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1062 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:29,229 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3300 Valid, 5232 Invalid, 6623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 5396 Invalid, 0 Unknown, 1062 Unchecked, 2.6s Time] [2022-02-10 23:44:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2022-02-10 23:44:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 8702. [2022-02-10 23:44:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8702 states, 8689 states have (on average 2.0252042812751756) internal successors, (17597), 8701 states have internal predecessors, (17597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 17597 transitions. [2022-02-10 23:44:29,403 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 17597 transitions. Word has length 134 [2022-02-10 23:44:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:29,403 INFO L470 AbstractCegarLoop]: Abstraction has 8702 states and 17597 transitions. [2022-02-10 23:44:29,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 17597 transitions. [2022-02-10 23:44:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:29,406 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:29,407 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:44:29,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-02-10 23:44:29,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:29,607 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:29,608 INFO L85 PathProgramCache]: Analyzing trace with hash 277245459, now seen corresponding path program 2 times [2022-02-10 23:44:29,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:29,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410583803] [2022-02-10 23:44:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:29,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:29,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410583803] [2022-02-10 23:44:29,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410583803] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:29,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176592924] [2022-02-10 23:44:29,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:44:29,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:29,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:29,837 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:29,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-02-10 23:44:30,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:44:30,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:44:30,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-10 23:44:30,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:30,685 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 11 treesize of output 7 [2022-02-10 23:44:30,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:30,719 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 21 treesize of output 20 [2022-02-10 23:44:30,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:30,775 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 30 treesize of output 32 [2022-02-10 23:44:30,871 INFO L353 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2022-02-10 23:44:30,871 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 42 treesize of output 47 [2022-02-10 23:44:30,974 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-10 23:44:30,974 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 39 treesize of output 44 [2022-02-10 23:44:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:31,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:31,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:31,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:31,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:31,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:44:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:31,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176592924] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:31,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:31,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-02-10 23:44:31,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183844452] [2022-02-10 23:44:31,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:31,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 23:44:31,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:31,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 23:44:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 23:44:31,786 INFO L87 Difference]: Start difference. First operand 8702 states and 17597 transitions. Second operand has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:36,481 INFO L93 Difference]: Finished difference Result 15900 states and 31856 transitions. [2022-02-10 23:44:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-10 23:44:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 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 134 [2022-02-10 23:44:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:36,508 INFO L225 Difference]: With dead ends: 15900 [2022-02-10 23:44:36,508 INFO L226 Difference]: Without dead ends: 15867 [2022-02-10 23:44:36,509 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1261, Invalid=5879, Unknown=0, NotChecked=0, Total=7140 [2022-02-10 23:44:36,510 INFO L934 BasicCegarLoop]: 391 mSDtfsCounter, 3853 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 6025 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3853 SdHoareTripleChecker+Valid, 5704 SdHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 6025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:36,510 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3853 Valid, 5704 Invalid, 6964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 6025 Invalid, 0 Unknown, 660 Unchecked, 2.8s Time] [2022-02-10 23:44:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2022-02-10 23:44:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 8712. [2022-02-10 23:44:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 8699 states have (on average 2.024830440280492) internal successors, (17614), 8711 states have internal predecessors, (17614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 17614 transitions. [2022-02-10 23:44:36,689 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 17614 transitions. Word has length 134 [2022-02-10 23:44:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:36,689 INFO L470 AbstractCegarLoop]: Abstraction has 8712 states and 17614 transitions. [2022-02-10 23:44:36,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 6.0256410256410255) internal successors, (235), 40 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 17614 transitions. [2022-02-10 23:44:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:36,693 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:36,693 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:44:36,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-02-10 23:44:36,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-02-10 23:44:36,893 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1655652432, now seen corresponding path program 1 times [2022-02-10 23:44:36,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:36,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460302820] [2022-02-10 23:44:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:37,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:37,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460302820] [2022-02-10 23:44:37,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460302820] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:37,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512200702] [2022-02-10 23:44:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:37,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:37,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:37,094 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:37,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-02-10 23:44:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:37,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-10 23:44:37,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:37,922 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 11 treesize of output 7 [2022-02-10 23:44:37,957 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-02-10 23:44:37,957 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 26 treesize of output 25 [2022-02-10 23:44:37,987 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-10 23:44:37,988 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 21 treesize of output 20 [2022-02-10 23:44:38,031 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-10 23:44:38,032 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 30 treesize of output 32 [2022-02-10 23:44:38,080 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-10 23:44:38,080 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 39 treesize of output 44 [2022-02-10 23:44:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:38,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:44:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:38,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512200702] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:44:38,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:44:38,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-02-10 23:44:38,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386535328] [2022-02-10 23:44:38,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:44:38,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 23:44:38,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:44:38,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 23:44:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 23:44:38,583 INFO L87 Difference]: Start difference. First operand 8712 states and 17614 transitions. Second operand has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:44:43,917 INFO L93 Difference]: Finished difference Result 16123 states and 32198 transitions. [2022-02-10 23:44:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-02-10 23:44:43,918 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 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 134 [2022-02-10 23:44:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:44:43,940 INFO L225 Difference]: With dead ends: 16123 [2022-02-10 23:44:43,940 INFO L226 Difference]: Without dead ends: 16123 [2022-02-10 23:44:43,941 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 241 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2013, Invalid=11097, Unknown=0, NotChecked=0, Total=13110 [2022-02-10 23:44:43,942 INFO L934 BasicCegarLoop]: 428 mSDtfsCounter, 3324 mSDsluCounter, 5302 mSDsCounter, 0 mSdLazyCounter, 6724 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 5727 SdHoareTripleChecker+Invalid, 7260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 6724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:44:43,942 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3324 Valid, 5727 Invalid, 7260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 6724 Invalid, 0 Unknown, 189 Unchecked, 2.8s Time] [2022-02-10 23:44:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16123 states. [2022-02-10 23:44:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16123 to 8900. [2022-02-10 23:44:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8900 states, 8887 states have (on average 2.024192640936199) internal successors, (17989), 8899 states have internal predecessors, (17989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8900 states to 8900 states and 17989 transitions. [2022-02-10 23:44:44,094 INFO L78 Accepts]: Start accepts. Automaton has 8900 states and 17989 transitions. Word has length 134 [2022-02-10 23:44:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:44:44,094 INFO L470 AbstractCegarLoop]: Abstraction has 8900 states and 17989 transitions. [2022-02-10 23:44:44,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:44:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8900 states and 17989 transitions. [2022-02-10 23:44:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:44:44,098 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:44:44,098 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:44:44,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-02-10 23:44:44,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-02-10 23:44:44,299 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:44:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:44:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1965972689, now seen corresponding path program 1 times [2022-02-10 23:44:44,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:44:44,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590714252] [2022-02-10 23:44:44,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:44,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:44:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:44,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:44:44,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590714252] [2022-02-10 23:44:44,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590714252] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:44:44,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038424571] [2022-02-10 23:44:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:44:44,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:44:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:44:44,744 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:44:44,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-02-10 23:44:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:44:45,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 23:44:45,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:44:45,604 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 11 treesize of output 7 [2022-02-10 23:44:45,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,645 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 21 treesize of output 20 [2022-02-10 23:44:45,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,805 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 30 treesize of output 32 [2022-02-10 23:44:45,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:45,987 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 39 treesize of output 44 [2022-02-10 23:44:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-02-10 23:44:46,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-10 23:44:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-10 23:44:46,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-10 23:44:46,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:44:46,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2022-02-10 23:44:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:44:52,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:45:31,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post38#1| 1) |v_ULTIMATE.start_main_~i~2#1_22|)))) is different from false [2022-02-10 23:46:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:46:59,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038424571] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:46:59,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:46:59,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-02-10 23:46:59,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856231666] [2022-02-10 23:46:59,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:46:59,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-10 23:46:59,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:46:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-10 23:46:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1621, Unknown=52, NotChecked=84, Total=1980 [2022-02-10 23:46:59,770 INFO L87 Difference]: Start difference. First operand 8900 states and 17989 transitions. Second operand has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:47:03,049 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= |c_ULTIMATE.start_main_#t~post38#1| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse3 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post38#1| 1) |v_ULTIMATE.start_main_~i~2#1_22|)))) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (<= 0 |c_ULTIMATE.start_main_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2022-02-10 23:47:56,302 WARN L228 SmtUtils]: Spent 11.06s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:48:56,881 WARN L228 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-10 23:48:58,992 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= 0 (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse4 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) .cse6 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_ULTIMATE.start_main_~i~2#1_22| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_main_~i~2#1_22| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_ULTIMATE.start_main_~i~2#1_22| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (and (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse7 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse7 |c_~#cache~0.base| (store (store (store (select .cse7 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse9 0)))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9)) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (select (select (let ((.cse10 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse10 |c_~#cache~0.base| (store (store (store (select .cse10 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5207 Int) (v_ArrVal_5210 Int)) (= (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse11 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) v_ArrVal_5207) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| v_ArrVal_5210))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12)) 0))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ (* |v_ULTIMATE.start_main_~i~2#1_22| 28) |c_~#cache~0.offset|))))) is different from false [2022-02-10 23:49:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:49:01,695 INFO L93 Difference]: Finished difference Result 18580 states and 37309 transitions. [2022-02-10 23:49:01,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-10 23:49:01,696 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 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 134 [2022-02-10 23:49:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:49:01,721 INFO L225 Difference]: With dead ends: 18580 [2022-02-10 23:49:01,721 INFO L226 Difference]: Without dead ends: 18580 [2022-02-10 23:49:01,722 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 250.8s TimeCoverageRelationStatistics Valid=744, Invalid=4004, Unknown=94, NotChecked=414, Total=5256 [2022-02-10 23:49:01,722 INFO L934 BasicCegarLoop]: 282 mSDtfsCounter, 1327 mSDsluCounter, 4226 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 4506 SdHoareTripleChecker+Invalid, 5725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2538 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:49:01,722 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 4506 Invalid, 5725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3116 Invalid, 0 Unknown, 2538 Unchecked, 2.2s Time] [2022-02-10 23:49:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18580 states. [2022-02-10 23:49:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18580 to 8928. [2022-02-10 23:49:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8928 states, 8915 states have (on average 2.024116657319125) internal successors, (18045), 8927 states have internal predecessors, (18045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:49:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8928 states to 8928 states and 18045 transitions. [2022-02-10 23:49:01,867 INFO L78 Accepts]: Start accepts. Automaton has 8928 states and 18045 transitions. Word has length 134 [2022-02-10 23:49:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:49:01,868 INFO L470 AbstractCegarLoop]: Abstraction has 8928 states and 18045 transitions. [2022-02-10 23:49:01,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:49:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8928 states and 18045 transitions. [2022-02-10 23:49:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-10 23:49:01,871 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:49:01,871 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:49:01,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-02-10 23:49:02,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-02-10 23:49:02,072 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-10 23:49:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:49:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash 154946487, now seen corresponding path program 2 times [2022-02-10 23:49:02,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:49:02,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747818722] [2022-02-10 23:49:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:49:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:49:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:49:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:49:02,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:49:02,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747818722] [2022-02-10 23:49:02,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747818722] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:49:02,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336702322] [2022-02-10 23:49:02,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:49:02,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:49:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:49:02,684 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:49:02,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-02-10 23:49:02,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:49:02,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:49:03,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-10 23:49:03,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:49:03,835 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 11 treesize of output 7 [2022-02-10 23:49:03,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:03,915 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 21 treesize of output 20 [2022-02-10 23:49:04,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,104 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 30 treesize of output 32 [2022-02-10 23:49:04,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,359 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 37 treesize of output 42 [2022-02-10 23:49:04,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,389 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 39 treesize of output 44 [2022-02-10 23:49:04,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,425 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 39 treesize of output 44 [2022-02-10 23:49:04,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,456 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 39 treesize of output 44 [2022-02-10 23:49:04,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 80 [2022-02-10 23:49:04,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:49:04,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 103 [2022-02-10 23:49:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:49:08,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:50:21,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_24| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post38#1| 1) |v_ULTIMATE.start_main_~i~2#1_24|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_5365 Int) (v_ArrVal_5363 Int)) (let ((.cse16 (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)) (.cse1 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (let ((.cse0 (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)) |c_~#cache~0.base|) .cse16 v_ArrVal_5363) .cse1 v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))) (or (not (= (select .cse0 .cse1) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |v_ULTIMATE.start_main_~i~2#1_24| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_5371 Int)) (= (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (let ((.cse3 (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5371 Int)) (= (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse15 |c_~#cache~0.base| (store (store (store (select .cse15 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |c_~#cache~0.base| (store (select .cse13 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))) (not (= (select .cse0 .cse16) 0)))))))) is different from false [2022-02-10 23:50:25,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_24| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_5365 Int) (v_ArrVal_5363 Int)) (let ((.cse16 (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)) (.cse1 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|))) (let ((.cse0 (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)) |c_~#cache~0.base|) .cse16 v_ArrVal_5363) .cse1 v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))) (or (not (= (select .cse0 .cse1) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |v_ULTIMATE.start_main_~i~2#1_24| 28) |c_~#cache~0.offset|)) (< |v_ULTIMATE.start_main_~i~2#1_24| (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (and (forall ((v_ArrVal_5371 Int)) (= (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (let ((.cse3 (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5371 Int)) (= (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0)))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (forall ((v_ArrVal_5371 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse15 |c_~#cache~0.base| (store (store (store (select .cse15 |c_~#cache~0.base|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5363) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) v_ArrVal_5365) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 0))))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |c_~#cache~0.base| (store (select .cse13 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| v_ArrVal_5371))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))) (not (= (select .cse0 .cse16) 0)))))) is different from false [2022-02-10 23:51:06,200 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-02-10 23:51:06,201 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 100956 treesize of output 100948 [2022-02-10 23:51:09,551 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:51:09,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7614 treesize of output 7608 [2022-02-10 23:51:09,601 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-10 23:51:09,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-02-10 23:51:09,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-02-10 23:51:09,816 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:308) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-10 23:51:09,820 INFO L158 Benchmark]: Toolchain (without parser) took 496308.69ms. Allocated memory was 179.3MB in the beginning and 671.1MB in the end (delta: 491.8MB). Free memory was 126.7MB in the beginning and 282.3MB in the end (delta: -155.6MB). Peak memory consumption was 385.8MB. Max. memory is 8.0GB. [2022-02-10 23:51:09,820 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 145.2MB in the beginning and 145.2MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:51:09,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.81ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 126.5MB in the beginning and 176.4MB in the end (delta: -49.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-10 23:51:09,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.20ms. Allocated memory is still 216.0MB. Free memory was 176.4MB in the beginning and 173.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 23:51:09,820 INFO L158 Benchmark]: Boogie Preprocessor took 49.67ms. Allocated memory is still 216.0MB. Free memory was 173.8MB in the beginning and 171.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:51:09,821 INFO L158 Benchmark]: RCFGBuilder took 444.96ms. Allocated memory is still 216.0MB. Free memory was 171.7MB in the beginning and 154.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-02-10 23:51:09,821 INFO L158 Benchmark]: TraceAbstraction took 495105.32ms. Allocated memory was 216.0MB in the beginning and 671.1MB in the end (delta: 455.1MB). Free memory was 154.9MB in the beginning and 282.3MB in the end (delta: -127.4MB). Peak memory consumption was 378.3MB. Max. memory is 8.0GB. [2022-02-10 23:51:09,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 145.2MB in the beginning and 145.2MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 630.81ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 126.5MB in the beginning and 176.4MB in the end (delta: -49.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.20ms. Allocated memory is still 216.0MB. Free memory was 176.4MB in the beginning and 173.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.67ms. Allocated memory is still 216.0MB. Free memory was 173.8MB in the beginning and 171.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 444.96ms. Allocated memory is still 216.0MB. Free memory was 171.7MB in the beginning and 154.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 495105.32ms. Allocated memory was 216.0MB in the beginning and 671.1MB in the end (delta: 455.1MB). Free memory was 154.9MB in the beginning and 282.3MB in the end (delta: -127.4MB). Peak memory consumption was 378.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:108) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-10 23:51:09,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...