/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_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-18 15:35:29,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-18 15:35:29,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-18 15:35:29,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-18 15:35:29,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-18 15:35:29,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-18 15:35:29,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-18 15:35:29,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-18 15:35:29,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-18 15:35:29,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-18 15:35:29,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-18 15:35:29,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-18 15:35:29,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-18 15:35:29,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-18 15:35:29,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-18 15:35:29,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-18 15:35:29,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-18 15:35:29,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-18 15:35:29,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-18 15:35:29,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-18 15:35:29,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-18 15:35:29,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-18 15:35:29,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-18 15:35:29,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-18 15:35:29,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-18 15:35:29,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-18 15:35:29,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-18 15:35:29,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-18 15:35:29,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-18 15:35:29,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-18 15:35:29,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-18 15:35:29,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-18 15:35:29,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-18 15:35:29,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-18 15:35:29,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-18 15:35:29,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-18 15:35:29,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-18 15:35:29,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-18 15:35:29,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-18 15:35:29,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-18 15:35:29,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-18 15:35:29,191 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-18 15:35:29,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-18 15:35:29,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-18 15:35:29,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-18 15:35:29,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-18 15:35:29,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-18 15:35:29,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-18 15:35:29,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * Use SBE=true [2022-02-18 15:35:29,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-18 15:35:29,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-18 15:35:29,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-18 15:35:29,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 15:35:29,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-18 15:35:29,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-18 15:35:29,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-18 15:35:29,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-18 15:35:29,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-18 15:35:29,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-18 15:35:29,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-18 15:35:29,215 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-18 15:35:29,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-18 15:35:29,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-18 15:35:29,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-18 15:35:29,393 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-18 15:35:29,393 INFO L275 PluginConnector]: CDTParser initialized [2022-02-18 15:35:29,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-02-18 15:35:29,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c280e3c/cd6e762dd7134d458c840079ccbd5245/FLAG7b610dabb [2022-02-18 15:35:29,817 INFO L306 CDTParser]: Found 1 translation units. [2022-02-18 15:35:29,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-02-18 15:35:29,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c280e3c/cd6e762dd7134d458c840079ccbd5245/FLAG7b610dabb [2022-02-18 15:35:29,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c280e3c/cd6e762dd7134d458c840079ccbd5245 [2022-02-18 15:35:29,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-18 15:35:29,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-18 15:35:29,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-18 15:35:29,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-18 15:35:29,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-18 15:35:29,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:35:29" (1/1) ... [2022-02-18 15:35:29,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8895b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:29, skipping insertion in model container [2022-02-18 15:35:29,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:35:29" (1/1) ... [2022-02-18 15:35:29,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-18 15:35:29,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-18 15:35:30,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 15:35:30,213 INFO L203 MainTranslator]: Completed pre-run [2022-02-18 15:35:30,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 15:35:30,288 INFO L208 MainTranslator]: Completed translation [2022-02-18 15:35:30,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30 WrapperNode [2022-02-18 15:35:30,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-18 15:35:30,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-18 15:35:30,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-18 15:35:30,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-18 15:35:30,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,348 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-02-18 15:35:30,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-18 15:35:30,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-18 15:35:30,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-18 15:35:30,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-18 15:35:30,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-18 15:35:30,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-18 15:35:30,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-18 15:35:30,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-18 15:35:30,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (1/1) ... [2022-02-18 15:35:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 15:35:30,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:30,417 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-18 15:35:30,435 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-18 15:35:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-18 15:35:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-18 15:35:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-18 15:35:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-18 15:35:30,444 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-18 15:35:30,530 INFO L234 CfgBuilder]: Building ICFG [2022-02-18 15:35:30,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-18 15:35:30,692 INFO L275 CfgBuilder]: Performing block encoding [2022-02-18 15:35:30,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-18 15:35:30,697 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-18 15:35:30,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:35:30 BoogieIcfgContainer [2022-02-18 15:35:30,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-18 15:35:30,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-18 15:35:30,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-18 15:35:30,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-18 15:35:30,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:35:29" (1/3) ... [2022-02-18 15:35:30,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387abc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:35:30, skipping insertion in model container [2022-02-18 15:35:30,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:35:30" (2/3) ... [2022-02-18 15:35:30,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387abc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:35:30, skipping insertion in model container [2022-02-18 15:35:30,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:35:30" (3/3) ... [2022-02-18 15:35:30,703 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-02-18 15:35:30,707 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-18 15:35:30,707 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-18 15:35:30,707 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-18 15:35:30,707 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-18 15:35:30,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 15:35:30,767 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-18 15:35:30,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-18 15:35:30,799 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, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-02-18 15:35:30,799 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-18 15:35:30,807 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 106 transitions, 217 flow [2022-02-18 15:35:30,861 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 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-18 15:35:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 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-18 15:35:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-18 15:35:30,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:30,876 INFO L514 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] [2022-02-18 15:35:30,876 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1089390899, now seen corresponding path program 1 times [2022-02-18 15:35:30,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:30,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882747583] [2022-02-18 15:35:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:31,066 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-18 15:35:31,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:31,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882747583] [2022-02-18 15:35:31,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882747583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:31,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 15:35:31,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-18 15:35:31,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041696929] [2022-02-18 15:35:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:31,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-18 15:35:31,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:31,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-18 15:35:31,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-18 15:35:31,107 INFO L87 Difference]: Start difference. First operand has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 15:35:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:31,150 INFO L93 Difference]: Finished difference Result 1519 states and 3016 transitions. [2022-02-18 15:35:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 15:35:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-18 15:35:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:31,176 INFO L225 Difference]: With dead ends: 1519 [2022-02-18 15:35:31,176 INFO L226 Difference]: Without dead ends: 1519 [2022-02-18 15:35:31,182 INFO L932 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-18 15:35:31,186 INFO L933 BasicCegarLoop]: 101 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, 101 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-18 15:35:31,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 15:35:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-02-18 15:35:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2022-02-18 15:35:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1511 states have (on average 1.9960291197882196) internal successors, (3016), 1518 states have internal predecessors, (3016), 0 states have call successors, (0), 0 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-18 15:35:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3016 transitions. [2022-02-18 15:35:31,274 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3016 transitions. Word has length 35 [2022-02-18 15:35:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:31,275 INFO L470 AbstractCegarLoop]: Abstraction has 1519 states and 3016 transitions. [2022-02-18 15:35:31,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 15:35:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3016 transitions. [2022-02-18 15:35:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-18 15:35:31,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:31,281 INFO L514 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] [2022-02-18 15:35:31,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-18 15:35:31,282 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1960811916, now seen corresponding path program 1 times [2022-02-18 15:35:31,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:31,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092908176] [2022-02-18 15:35:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:31,361 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-18 15:35:31,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:31,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092908176] [2022-02-18 15:35:31,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092908176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:31,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 15:35:31,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 15:35:31,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041469390] [2022-02-18 15:35:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:31,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 15:35:31,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 15:35:31,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 15:35:31,364 INFO L87 Difference]: Start difference. First operand 1519 states and 3016 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 15:35:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:31,400 INFO L93 Difference]: Finished difference Result 1523 states and 3020 transitions. [2022-02-18 15:35:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 15:35:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-18 15:35:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:31,405 INFO L225 Difference]: With dead ends: 1523 [2022-02-18 15:35:31,405 INFO L226 Difference]: Without dead ends: 1523 [2022-02-18 15:35:31,406 INFO L932 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-18 15:35:31,406 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 192 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-18 15:35:31,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 15:35:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-02-18 15:35:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2022-02-18 15:35:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1512 states have (on average 1.9953703703703705) internal successors, (3017), 1519 states have internal predecessors, (3017), 0 states have call successors, (0), 0 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-18 15:35:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3017 transitions. [2022-02-18 15:35:31,447 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3017 transitions. Word has length 35 [2022-02-18 15:35:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:31,447 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 3017 transitions. [2022-02-18 15:35:31,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 15:35:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3017 transitions. [2022-02-18 15:35:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-18 15:35:31,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:31,449 INFO L514 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-18 15:35:31,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-18 15:35:31,449 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2113524451, now seen corresponding path program 1 times [2022-02-18 15:35:31,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:31,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334334893] [2022-02-18 15:35:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:31,533 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-18 15:35:31,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:31,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334334893] [2022-02-18 15:35:31,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334334893] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:31,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146831897] [2022-02-18 15:35:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:31,539 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-18 15:35:31,540 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-18 15:35:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:31,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-18 15:35:31,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:31,751 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-18 15:35:31,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:35:31,827 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-18 15:35:31,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146831897] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:35:31,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:35:31,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-18 15:35:31,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447208259] [2022-02-18 15:35:31,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:35:31,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:31,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-18 15:35:31,829 INFO L87 Difference]: Start difference. First operand 1520 states and 3017 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-18 15:35:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:31,938 INFO L93 Difference]: Finished difference Result 1530 states and 3027 transitions. [2022-02-18 15:35:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-18 15:35:31,941 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-18 15:35:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:31,945 INFO L225 Difference]: With dead ends: 1530 [2022-02-18 15:35:31,945 INFO L226 Difference]: Without dead ends: 1530 [2022-02-18 15:35:31,946 INFO L932 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-18 15:35:31,946 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:31,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 385 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 15:35:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-02-18 15:35:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-02-18 15:35:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1522 states have (on average 1.9888304862023654) internal successors, (3027), 1529 states have internal predecessors, (3027), 0 states have call successors, (0), 0 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-18 15:35:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3027 transitions. [2022-02-18 15:35:31,976 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3027 transitions. Word has length 40 [2022-02-18 15:35:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:31,977 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 3027 transitions. [2022-02-18 15:35:31,977 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-18 15:35:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3027 transitions. [2022-02-18 15:35:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-18 15:35:31,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:31,979 INFO L514 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-18 15:35:32,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-18 15:35:32,193 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-18 15:35:32,193 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 37547901, now seen corresponding path program 2 times [2022-02-18 15:35:32,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:32,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570839452] [2022-02-18 15:35:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:32,333 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-18 15:35:32,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:32,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570839452] [2022-02-18 15:35:32,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570839452] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:32,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551170779] [2022-02-18 15:35:32,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:35:32,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:32,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:32,343 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-18 15:35:32,344 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-18 15:35:32,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:35:32,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:32,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-18 15:35:32,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:32,528 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-18 15:35:32,555 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-18 15:35:32,556 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-18 15:35:32,613 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-18 15:35:32,614 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-18 15:35:32,680 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-18 15:35:32,680 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-18 15:35:32,697 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-18 15:35:32,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:32,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551170779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:32,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:32,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-18 15:35:32,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979169562] [2022-02-18 15:35:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:32,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 15:35:32,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 15:35:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-18 15:35:32,699 INFO L87 Difference]: Start difference. First operand 1530 states and 3027 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-18 15:35:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:32,860 INFO L93 Difference]: Finished difference Result 1831 states and 3629 transitions. [2022-02-18 15:35:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-18 15:35:32,861 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-18 15:35:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:32,868 INFO L225 Difference]: With dead ends: 1831 [2022-02-18 15:35:32,868 INFO L226 Difference]: Without dead ends: 1831 [2022-02-18 15:35:32,868 INFO L932 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-18 15:35:32,870 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 136 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:32,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 498 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 15:35:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-02-18 15:35:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1679. [2022-02-18 15:35:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1671 states have (on average 1.9898264512268102) internal successors, (3325), 1678 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 15:35:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3325 transitions. [2022-02-18 15:35:32,908 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3325 transitions. Word has length 50 [2022-02-18 15:35:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:32,909 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3325 transitions. [2022-02-18 15:35:32,909 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-18 15:35:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3325 transitions. [2022-02-18 15:35:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-18 15:35:32,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:32,912 INFO L514 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-18 15:35:32,928 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-18 15:35:33,129 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-18 15:35:33,129 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1921653659, now seen corresponding path program 1 times [2022-02-18 15:35:33,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:33,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260960441] [2022-02-18 15:35:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:33,234 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-18 15:35:33,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:33,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260960441] [2022-02-18 15:35:33,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260960441] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:33,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857293419] [2022-02-18 15:35:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:33,236 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-18 15:35:33,237 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-18 15:35:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:33,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-18 15:35:33,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:33,377 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-18 15:35:33,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:35:33,518 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-18 15:35:33,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857293419] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:35:33,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:35:33,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-18 15:35:33,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001185597] [2022-02-18 15:35:33,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:35:33,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-18 15:35:33,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:33,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-18 15:35:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:35:33,521 INFO L87 Difference]: Start difference. First operand 1679 states and 3325 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-18 15:35:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:33,654 INFO L93 Difference]: Finished difference Result 1699 states and 3345 transitions. [2022-02-18 15:35:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-18 15:35:33,655 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-18 15:35:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:33,660 INFO L225 Difference]: With dead ends: 1699 [2022-02-18 15:35:33,660 INFO L226 Difference]: Without dead ends: 1699 [2022-02-18 15:35:33,660 INFO L932 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-18 15:35:33,661 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:33,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 480 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 15:35:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-02-18 15:35:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2022-02-18 15:35:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1691 states have (on average 1.978119455943229) internal successors, (3345), 1698 states have internal predecessors, (3345), 0 states have call successors, (0), 0 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-18 15:35:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3345 transitions. [2022-02-18 15:35:33,688 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3345 transitions. Word has length 50 [2022-02-18 15:35:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:33,688 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 3345 transitions. [2022-02-18 15:35:33,688 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-18 15:35:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3345 transitions. [2022-02-18 15:35:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-18 15:35:33,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:33,689 INFO L514 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-18 15:35:33,708 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-18 15:35:33,902 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-18 15:35:33,903 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1189660581, now seen corresponding path program 2 times [2022-02-18 15:35:33,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:33,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609705852] [2022-02-18 15:35:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:34,071 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-18 15:35:34,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:34,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609705852] [2022-02-18 15:35:34,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609705852] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:34,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665741889] [2022-02-18 15:35:34,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:35:34,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:34,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:34,072 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-18 15:35:34,111 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-18 15:35:34,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:35:34,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:34,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-18 15:35:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:34,270 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-18 15:35:34,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,294 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-18 15:35:34,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,324 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 15:35:34,324 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-18 15:35:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:35:34,358 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 15:35:34,358 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-18 15:35:34,381 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-18 15:35:34,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:34,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665741889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:34,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:34,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-02-18 15:35:34,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111994654] [2022-02-18 15:35:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:34,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:34,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-02-18 15:35:34,383 INFO L87 Difference]: Start difference. First operand 1699 states and 3345 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-18 15:35:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:34,742 INFO L93 Difference]: Finished difference Result 3571 states and 7089 transitions. [2022-02-18 15:35:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 15:35:34,743 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-18 15:35:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:34,754 INFO L225 Difference]: With dead ends: 3571 [2022-02-18 15:35:34,754 INFO L226 Difference]: Without dead ends: 3571 [2022-02-18 15:35:34,755 INFO L932 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-18 15:35:34,755 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 532 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:34,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 1127 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:35:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-02-18 15:35:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2167. [2022-02-18 15:35:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2159 states have (on average 1.982862436313108) internal successors, (4281), 2166 states have internal predecessors, (4281), 0 states have call successors, (0), 0 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-18 15:35:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4281 transitions. [2022-02-18 15:35:34,799 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4281 transitions. Word has length 70 [2022-02-18 15:35:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:34,799 INFO L470 AbstractCegarLoop]: Abstraction has 2167 states and 4281 transitions. [2022-02-18 15:35:34,800 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-18 15:35:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4281 transitions. [2022-02-18 15:35:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-18 15:35:34,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:34,801 INFO L514 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-18 15:35:34,819 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-18 15:35:35,017 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-18 15:35:35,018 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1998481730, now seen corresponding path program 1 times [2022-02-18 15:35:35,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:35,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847111763] [2022-02-18 15:35:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:35,181 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-18 15:35:35,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:35,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847111763] [2022-02-18 15:35:35,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847111763] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:35,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038978798] [2022-02-18 15:35:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:35,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:35,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:35,183 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-18 15:35:35,188 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-18 15:35:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:35,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-18 15:35:35,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:35,394 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-18 15:35:35,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:35:35,542 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-18 15:35:35,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038978798] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:35:35,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:35:35,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-18 15:35:35,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562428762] [2022-02-18 15:35:35,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:35:35,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-18 15:35:35,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-18 15:35:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-18 15:35:35,544 INFO L87 Difference]: Start difference. First operand 2167 states and 4281 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-18 15:35:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:35,760 INFO L93 Difference]: Finished difference Result 2182 states and 4296 transitions. [2022-02-18 15:35:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-18 15:35:35,761 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-18 15:35:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:35,768 INFO L225 Difference]: With dead ends: 2182 [2022-02-18 15:35:35,768 INFO L226 Difference]: Without dead ends: 2182 [2022-02-18 15:35:35,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-02-18 15:35:35,769 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:35,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 764 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 15:35:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2022-02-18 15:35:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2022-02-18 15:35:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2174 states have (on average 1.9760809567617295) internal successors, (4296), 2181 states have internal predecessors, (4296), 0 states have call successors, (0), 0 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-18 15:35:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 4296 transitions. [2022-02-18 15:35:35,804 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 4296 transitions. Word has length 78 [2022-02-18 15:35:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:35,805 INFO L470 AbstractCegarLoop]: Abstraction has 2182 states and 4296 transitions. [2022-02-18 15:35:35,805 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-18 15:35:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 4296 transitions. [2022-02-18 15:35:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-18 15:35:35,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:35,806 INFO L514 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-18 15:35:35,837 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-18 15:35:36,038 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-18 15:35:36,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 920350873, now seen corresponding path program 2 times [2022-02-18 15:35:36,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:36,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280301395] [2022-02-18 15:35:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:36,131 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-18 15:35:36,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:36,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280301395] [2022-02-18 15:35:36,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280301395] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:36,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 15:35:36,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-18 15:35:36,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399148733] [2022-02-18 15:35:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:36,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 15:35:36,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:36,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 15:35:36,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-18 15:35:36,132 INFO L87 Difference]: Start difference. First operand 2182 states and 4296 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-18 15:35:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:36,232 INFO L93 Difference]: Finished difference Result 2448 states and 4828 transitions. [2022-02-18 15:35:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-18 15:35:36,232 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-18 15:35:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:36,239 INFO L225 Difference]: With dead ends: 2448 [2022-02-18 15:35:36,240 INFO L226 Difference]: Without dead ends: 2203 [2022-02-18 15:35:36,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-18 15:35:36,240 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 141 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:36,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 397 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 15:35:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-02-18 15:35:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2098. [2022-02-18 15:35:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2090 states have (on average 1.9684210526315788) internal successors, (4114), 2097 states have internal predecessors, (4114), 0 states have call successors, (0), 0 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-18 15:35:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4114 transitions. [2022-02-18 15:35:36,277 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4114 transitions. Word has length 93 [2022-02-18 15:35:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:36,278 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 4114 transitions. [2022-02-18 15:35:36,279 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-18 15:35:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4114 transitions. [2022-02-18 15:35:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-18 15:35:36,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:36,283 INFO L514 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-18 15:35:36,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-18 15:35:36,283 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1018614855, now seen corresponding path program 1 times [2022-02-18 15:35:36,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:36,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936786898] [2022-02-18 15:35:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:36,403 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-18 15:35:36,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:36,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936786898] [2022-02-18 15:35:36,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936786898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:36,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 15:35:36,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-18 15:35:36,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877842310] [2022-02-18 15:35:36,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:36,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 15:35:36,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 15:35:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-18 15:35:36,405 INFO L87 Difference]: Start difference. First operand 2098 states and 4114 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-18 15:35:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:36,528 INFO L93 Difference]: Finished difference Result 2349 states and 4616 transitions. [2022-02-18 15:35:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-18 15:35:36,529 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-18 15:35:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:36,536 INFO L225 Difference]: With dead ends: 2349 [2022-02-18 15:35:36,536 INFO L226 Difference]: Without dead ends: 2349 [2022-02-18 15:35:36,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-18 15:35:36,538 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 125 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:36,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 15:35:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-02-18 15:35:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2229. [2022-02-18 15:35:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2221 states have (on average 1.970283656010806) internal successors, (4376), 2228 states have internal predecessors, (4376), 0 states have call successors, (0), 0 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-18 15:35:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4376 transitions. [2022-02-18 15:35:36,584 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4376 transitions. Word has length 93 [2022-02-18 15:35:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:36,585 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 4376 transitions. [2022-02-18 15:35:36,585 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-18 15:35:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4376 transitions. [2022-02-18 15:35:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:36,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:36,587 INFO L514 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-18 15:35:36,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-18 15:35:36,587 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1317609396, now seen corresponding path program 1 times [2022-02-18 15:35:36,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:36,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294526033] [2022-02-18 15:35:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:36,724 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-18 15:35:36,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:36,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294526033] [2022-02-18 15:35:36,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294526033] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:36,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659834936] [2022-02-18 15:35:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:36,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:36,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:36,725 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-18 15:35:36,726 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-18 15:35:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:36,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:36,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:37,015 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-18 15:35:37,093 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-18 15:35:37,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:37,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659834936] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:37,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:37,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:35:37,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7823566] [2022-02-18 15:35:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:37,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:37,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:35:37,095 INFO L87 Difference]: Start difference. First operand 2229 states and 4376 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-18 15:35:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:37,538 INFO L93 Difference]: Finished difference Result 6535 states and 12955 transitions. [2022-02-18 15:35:37,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-18 15:35:37,538 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-18 15:35:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:37,554 INFO L225 Difference]: With dead ends: 6535 [2022-02-18 15:35:37,555 INFO L226 Difference]: Without dead ends: 6535 [2022-02-18 15:35:37,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:37,555 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 663 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:37,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 1290 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:35:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-02-18 15:35:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 2407. [2022-02-18 15:35:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2399 states have (on average 1.964568570237599) internal successors, (4713), 2406 states have internal predecessors, (4713), 0 states have call successors, (0), 0 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-18 15:35:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4713 transitions. [2022-02-18 15:35:37,610 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4713 transitions. Word has length 105 [2022-02-18 15:35:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:37,610 INFO L470 AbstractCegarLoop]: Abstraction has 2407 states and 4713 transitions. [2022-02-18 15:35:37,611 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-18 15:35:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4713 transitions. [2022-02-18 15:35:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:37,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:37,612 INFO L514 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-18 15:35:37,633 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-18 15:35:37,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:37,827 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1330543596, now seen corresponding path program 2 times [2022-02-18 15:35:37,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:37,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657523172] [2022-02-18 15:35:37,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:37,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:37,961 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-18 15:35:37,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:37,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657523172] [2022-02-18 15:35:37,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657523172] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:37,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592009684] [2022-02-18 15:35:37,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:35:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:37,962 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-18 15:35:37,963 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-18 15:35:38,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:35:38,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:38,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:38,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:38,293 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-18 15:35:38,358 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-18 15:35:38,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:38,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592009684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:38,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:38,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:35:38,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520759271] [2022-02-18 15:35:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:38,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:38,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:38,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:35:38,360 INFO L87 Difference]: Start difference. First operand 2407 states and 4713 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-18 15:35:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:39,255 INFO L93 Difference]: Finished difference Result 5977 states and 11801 transitions. [2022-02-18 15:35:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-18 15:35:39,255 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-18 15:35:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:39,266 INFO L225 Difference]: With dead ends: 5977 [2022-02-18 15:35:39,266 INFO L226 Difference]: Without dead ends: 5977 [2022-02-18 15:35:39,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2022-02-18 15:35:39,267 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 1029 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:39,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 1297 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:35:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2022-02-18 15:35:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 2486. [2022-02-18 15:35:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2478 states have (on average 1.9580306698950767) internal successors, (4852), 2485 states have internal predecessors, (4852), 0 states have call successors, (0), 0 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-18 15:35:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4852 transitions. [2022-02-18 15:35:39,325 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4852 transitions. Word has length 105 [2022-02-18 15:35:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:39,325 INFO L470 AbstractCegarLoop]: Abstraction has 2486 states and 4852 transitions. [2022-02-18 15:35:39,326 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-18 15:35:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4852 transitions. [2022-02-18 15:35:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:39,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:39,327 INFO L514 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-18 15:35:39,357 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-18 15:35:39,546 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-18 15:35:39,546 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash -103262266, now seen corresponding path program 3 times [2022-02-18 15:35:39,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:39,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703939275] [2022-02-18 15:35:39,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:39,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:39,683 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-18 15:35:39,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:39,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703939275] [2022-02-18 15:35:39,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703939275] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:39,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683972476] [2022-02-18 15:35:39,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:35:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:39,685 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-18 15:35:39,687 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-18 15:35:39,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:35:39,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:39,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:39,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:39,967 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-18 15:35:40,060 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-18 15:35:40,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:40,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683972476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:40,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:40,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:35:40,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844421750] [2022-02-18 15:35:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:40,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:40,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:40,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:35:40,062 INFO L87 Difference]: Start difference. First operand 2486 states and 4852 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-18 15:35:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:40,501 INFO L93 Difference]: Finished difference Result 6280 states and 12407 transitions. [2022-02-18 15:35:40,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-18 15:35:40,501 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-18 15:35:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:40,513 INFO L225 Difference]: With dead ends: 6280 [2022-02-18 15:35:40,513 INFO L226 Difference]: Without dead ends: 6280 [2022-02-18 15:35:40,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-02-18 15:35:40,514 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 619 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:40,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 1457 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:35:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2022-02-18 15:35:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 2495. [2022-02-18 15:35:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2487 states have (on average 1.9581825492561318) internal successors, (4870), 2494 states have internal predecessors, (4870), 0 states have call successors, (0), 0 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-18 15:35:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4870 transitions. [2022-02-18 15:35:40,584 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4870 transitions. Word has length 105 [2022-02-18 15:35:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:40,584 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4870 transitions. [2022-02-18 15:35:40,584 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-18 15:35:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4870 transitions. [2022-02-18 15:35:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:40,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:40,586 INFO L514 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-18 15:35:40,605 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-18 15:35:40,799 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-18 15:35:40,800 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1750076570, now seen corresponding path program 4 times [2022-02-18 15:35:40,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:40,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885709970] [2022-02-18 15:35:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:41,146 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-18 15:35:41,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:41,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885709970] [2022-02-18 15:35:41,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885709970] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:41,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401603536] [2022-02-18 15:35:41,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:35:41,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:41,147 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-18 15:35:41,149 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-18 15:35:41,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:35:41,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:41,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-18 15:35:41,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:41,634 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-18 15:35:41,711 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-18 15:35:41,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:41,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401603536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:41,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:41,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:35:41,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804592986] [2022-02-18 15:35:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:41,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:41,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:41,713 INFO L87 Difference]: Start difference. First operand 2495 states and 4870 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-18 15:35:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:42,597 INFO L93 Difference]: Finished difference Result 7583 states and 14975 transitions. [2022-02-18 15:35:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-18 15:35:42,597 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-18 15:35:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:42,612 INFO L225 Difference]: With dead ends: 7583 [2022-02-18 15:35:42,612 INFO L226 Difference]: Without dead ends: 7583 [2022-02-18 15:35:42,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2022-02-18 15:35:42,613 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1024 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:42,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 1432 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:35:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-02-18 15:35:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 2492. [2022-02-18 15:35:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2484 states have (on average 1.9581320450885669) internal successors, (4864), 2491 states have internal predecessors, (4864), 0 states have call successors, (0), 0 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-18 15:35:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4864 transitions. [2022-02-18 15:35:42,690 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4864 transitions. Word has length 105 [2022-02-18 15:35:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:42,690 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 4864 transitions. [2022-02-18 15:35:42,690 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-18 15:35:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4864 transitions. [2022-02-18 15:35:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:42,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:42,693 INFO L514 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-18 15:35:42,713 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-18 15:35:42,910 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-18 15:35:42,911 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 412316490, now seen corresponding path program 5 times [2022-02-18 15:35:42,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:42,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809809875] [2022-02-18 15:35:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:43,268 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-18 15:35:43,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:43,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809809875] [2022-02-18 15:35:43,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809809875] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:43,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640905324] [2022-02-18 15:35:43,268 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:35:43,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:43,270 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-18 15:35:43,287 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-18 15:35:43,380 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:35:43,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:43,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:43,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:43,654 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-18 15:35:43,726 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-18 15:35:43,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:43,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640905324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:43,726 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:43,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:35:43,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507402324] [2022-02-18 15:35:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:43,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:43,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:43,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:43,727 INFO L87 Difference]: Start difference. First operand 2492 states and 4864 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-18 15:35:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:44,693 INFO L93 Difference]: Finished difference Result 7733 states and 15280 transitions. [2022-02-18 15:35:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-18 15:35:44,693 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-18 15:35:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:44,706 INFO L225 Difference]: With dead ends: 7733 [2022-02-18 15:35:44,706 INFO L226 Difference]: Without dead ends: 7733 [2022-02-18 15:35:44,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=411, Invalid=2345, Unknown=0, NotChecked=0, Total=2756 [2022-02-18 15:35:44,707 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1165 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:44,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 1515 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:35:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2022-02-18 15:35:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 2496. [2022-02-18 15:35:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2488 states have (on average 1.9581993569131833) internal successors, (4872), 2495 states have internal predecessors, (4872), 0 states have call successors, (0), 0 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-18 15:35:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4872 transitions. [2022-02-18 15:35:44,768 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4872 transitions. Word has length 105 [2022-02-18 15:35:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:44,769 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 4872 transitions. [2022-02-18 15:35:44,769 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-18 15:35:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4872 transitions. [2022-02-18 15:35:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:44,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:44,771 INFO L514 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-18 15:35:44,803 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-18 15:35:45,004 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-18 15:35:45,004 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash -155675980, now seen corresponding path program 6 times [2022-02-18 15:35:45,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:45,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665767605] [2022-02-18 15:35:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:45,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:45,135 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-18 15:35:45,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:45,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665767605] [2022-02-18 15:35:45,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665767605] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:45,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701170254] [2022-02-18 15:35:45,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:35:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:45,137 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-18 15:35:45,138 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-18 15:35:45,232 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-18 15:35:45,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:45,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:45,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:45,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-18 15:35:45,565 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-18 15:35:45,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:45,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701170254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:45,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:45,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:35:45,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439843221] [2022-02-18 15:35:45,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:45,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:45,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:35:45,567 INFO L87 Difference]: Start difference. First operand 2496 states and 4872 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-18 15:35:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:46,075 INFO L93 Difference]: Finished difference Result 6177 states and 12187 transitions. [2022-02-18 15:35:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-18 15:35:46,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-18 15:35:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:46,087 INFO L225 Difference]: With dead ends: 6177 [2022-02-18 15:35:46,087 INFO L226 Difference]: Without dead ends: 6177 [2022-02-18 15:35:46,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2022-02-18 15:35:46,090 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 977 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:46,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 1401 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:35:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2022-02-18 15:35:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 2536. [2022-02-18 15:35:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2528 states have (on average 1.9588607594936709) internal successors, (4952), 2535 states have internal predecessors, (4952), 0 states have call successors, (0), 0 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-18 15:35:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-02-18 15:35:46,137 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-02-18 15:35:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:46,137 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-02-18 15:35:46,137 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-18 15:35:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-02-18 15:35:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:46,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:46,141 INFO L514 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-18 15:35:46,159 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-18 15:35:46,355 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-18 15:35:46,355 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1295126466, now seen corresponding path program 7 times [2022-02-18 15:35:46,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:46,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392510310] [2022-02-18 15:35:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:46,466 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-18 15:35:46,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:46,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392510310] [2022-02-18 15:35:46,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392510310] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:46,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444162050] [2022-02-18 15:35:46,466 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:35:46,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:46,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:46,467 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-18 15:35:46,468 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-18 15:35:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:46,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:46,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:46,854 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-18 15:35:46,920 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-18 15:35:46,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:46,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444162050] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:46,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:46,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:35:46,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004996783] [2022-02-18 15:35:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:46,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:46,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:46,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:35:46,922 INFO L87 Difference]: Start difference. First operand 2536 states and 4952 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-18 15:35:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:47,813 INFO L93 Difference]: Finished difference Result 6219 states and 12247 transitions. [2022-02-18 15:35:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-18 15:35:47,813 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-18 15:35:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:47,821 INFO L225 Difference]: With dead ends: 6219 [2022-02-18 15:35:47,821 INFO L226 Difference]: Without dead ends: 6219 [2022-02-18 15:35:47,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=1226, Unknown=0, NotChecked=0, Total=1640 [2022-02-18 15:35:47,822 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 928 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:47,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 1487 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:35:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2022-02-18 15:35:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 2536. [2022-02-18 15:35:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2528 states have (on average 1.9588607594936709) internal successors, (4952), 2535 states have internal predecessors, (4952), 0 states have call successors, (0), 0 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-18 15:35:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-02-18 15:35:47,868 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-02-18 15:35:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:47,868 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-02-18 15:35:47,868 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-18 15:35:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-02-18 15:35:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:47,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:47,870 INFO L514 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-18 15:35:47,887 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-18 15:35:48,087 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-18 15:35:48,087 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2095944408, now seen corresponding path program 8 times [2022-02-18 15:35:48,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:48,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530273988] [2022-02-18 15:35:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:48,332 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-18 15:35:48,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:48,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530273988] [2022-02-18 15:35:48,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530273988] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:48,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796034773] [2022-02-18 15:35:48,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:35:48,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:48,333 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-18 15:35:48,334 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-18 15:35:48,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:35:48,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:48,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:48,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:48,660 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-18 15:35:48,766 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-18 15:35:48,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:48,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796034773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:48,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:48,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-02-18 15:35:48,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151261799] [2022-02-18 15:35:48,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:48,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:48,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-02-18 15:35:48,767 INFO L87 Difference]: Start difference. First operand 2536 states and 4952 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-18 15:35:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:49,121 INFO L93 Difference]: Finished difference Result 5867 states and 11581 transitions. [2022-02-18 15:35:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 15:35:49,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-18 15:35:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:49,129 INFO L225 Difference]: With dead ends: 5867 [2022-02-18 15:35:49,129 INFO L226 Difference]: Without dead ends: 5867 [2022-02-18 15:35:49,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-02-18 15:35:49,129 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 611 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:49,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1284 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:35:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2022-02-18 15:35:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 2554. [2022-02-18 15:35:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2546 states have (on average 1.9591516103692066) internal successors, (4988), 2553 states have internal predecessors, (4988), 0 states have call successors, (0), 0 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-18 15:35:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-02-18 15:35:49,182 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-02-18 15:35:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:49,182 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-02-18 15:35:49,182 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-18 15:35:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-02-18 15:35:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:49,184 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:49,184 INFO L514 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-18 15:35:49,215 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-18 15:35:49,401 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-18 15:35:49,402 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 552208584, now seen corresponding path program 9 times [2022-02-18 15:35:49,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:49,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291262001] [2022-02-18 15:35:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:49,601 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-18 15:35:49,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:49,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291262001] [2022-02-18 15:35:49,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291262001] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:49,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402303237] [2022-02-18 15:35:49,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:35:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:49,602 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-18 15:35:49,603 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-18 15:35:49,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:35:49,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:49,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:49,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:49,960 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-18 15:35:50,022 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-18 15:35:50,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:50,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402303237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:50,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:50,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:35:50,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177181264] [2022-02-18 15:35:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:50,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:50,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:35:50,024 INFO L87 Difference]: Start difference. First operand 2554 states and 4988 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-18 15:35:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:50,835 INFO L93 Difference]: Finished difference Result 7170 states and 14149 transitions. [2022-02-18 15:35:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-18 15:35:50,835 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-18 15:35:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:50,844 INFO L225 Difference]: With dead ends: 7170 [2022-02-18 15:35:50,845 INFO L226 Difference]: Without dead ends: 7170 [2022-02-18 15:35:50,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2022-02-18 15:35:50,845 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 950 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:50,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 1459 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:35:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2022-02-18 15:35:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 2551. [2022-02-18 15:35:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2543 states have (on average 1.959103421156115) internal successors, (4982), 2550 states have internal predecessors, (4982), 0 states have call successors, (0), 0 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-18 15:35:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-02-18 15:35:50,900 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-02-18 15:35:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:50,900 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-02-18 15:35:50,900 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-18 15:35:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-02-18 15:35:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:50,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:50,902 INFO L514 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-18 15:35:50,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-18 15:35:51,116 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-18 15:35:51,116 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1580365652, now seen corresponding path program 10 times [2022-02-18 15:35:51,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:51,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147108359] [2022-02-18 15:35:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:51,225 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-18 15:35:51,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:51,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147108359] [2022-02-18 15:35:51,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147108359] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:51,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913568229] [2022-02-18 15:35:51,226 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:35:51,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:51,227 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-18 15:35:51,254 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-18 15:35:51,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:35:51,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:51,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-18 15:35:51,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:51,564 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-18 15:35:51,609 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-18 15:35:51,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:51,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913568229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:51,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:51,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-02-18 15:35:51,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716343023] [2022-02-18 15:35:51,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:51,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-18 15:35:51,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-18 15:35:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-18 15:35:51,610 INFO L87 Difference]: Start difference. First operand 2551 states and 4982 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-18 15:35:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:52,405 INFO L93 Difference]: Finished difference Result 9974 states and 19724 transitions. [2022-02-18 15:35:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-18 15:35:52,405 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-18 15:35:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:52,418 INFO L225 Difference]: With dead ends: 9974 [2022-02-18 15:35:52,418 INFO L226 Difference]: Without dead ends: 9974 [2022-02-18 15:35:52,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2022-02-18 15:35:52,419 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 1228 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:52,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 1516 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:35:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2022-02-18 15:35:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 2555. [2022-02-18 15:35:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2547 states have (on average 1.9591676482135847) internal successors, (4990), 2554 states have internal predecessors, (4990), 0 states have call successors, (0), 0 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-18 15:35:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-02-18 15:35:52,485 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-02-18 15:35:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:52,485 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-02-18 15:35:52,486 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-18 15:35:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-02-18 15:35:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:52,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:52,487 INFO L514 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-18 15:35:52,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-18 15:35:52,695 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-18 15:35:52,695 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2146609174, now seen corresponding path program 11 times [2022-02-18 15:35:52,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:52,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580442518] [2022-02-18 15:35:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:52,986 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-18 15:35:52,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:52,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580442518] [2022-02-18 15:35:52,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580442518] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:52,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413565187] [2022-02-18 15:35:52,986 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:35:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:52,987 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-18 15:35:52,988 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-18 15:35:53,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:35:53,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:53,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:53,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:53,406 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-18 15:35:53,508 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-18 15:35:53,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:53,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413565187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:53,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:53,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:35:53,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922072061] [2022-02-18 15:35:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:53,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:53,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:53,510 INFO L87 Difference]: Start difference. First operand 2555 states and 4990 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-18 15:35:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:54,053 INFO L93 Difference]: Finished difference Result 7437 states and 14669 transitions. [2022-02-18 15:35:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-18 15:35:54,054 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-18 15:35:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:54,063 INFO L225 Difference]: With dead ends: 7437 [2022-02-18 15:35:54,063 INFO L226 Difference]: Without dead ends: 7437 [2022-02-18 15:35:54,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2022-02-18 15:35:54,064 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 817 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:54,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 1580 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:35:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2022-02-18 15:35:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 2557. [2022-02-18 15:35:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2549 states have (on average 1.959199686151432) internal successors, (4994), 2556 states have internal predecessors, (4994), 0 states have call successors, (0), 0 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-18 15:35:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-02-18 15:35:54,118 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-02-18 15:35:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:54,118 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-02-18 15:35:54,118 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-18 15:35:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-02-18 15:35:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:54,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:54,120 INFO L514 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-18 15:35:54,153 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-18 15:35:54,335 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-18 15:35:54,336 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash -697555676, now seen corresponding path program 12 times [2022-02-18 15:35:54,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:54,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246774278] [2022-02-18 15:35:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:54,610 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-18 15:35:54,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:54,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246774278] [2022-02-18 15:35:54,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246774278] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:54,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554396755] [2022-02-18 15:35:54,611 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:35:54,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:54,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:54,612 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-18 15:35:54,612 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-18 15:35:54,755 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-18 15:35:54,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:54,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:54,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:55,019 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-18 15:35:55,082 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-18 15:35:55,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:55,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554396755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:55,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:55,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:35:55,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661047585] [2022-02-18 15:35:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:55,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:55,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:55,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:55,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:55,084 INFO L87 Difference]: Start difference. First operand 2557 states and 4994 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-18 15:35:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:55,970 INFO L93 Difference]: Finished difference Result 7479 states and 14729 transitions. [2022-02-18 15:35:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-18 15:35:55,970 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-18 15:35:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:55,980 INFO L225 Difference]: With dead ends: 7479 [2022-02-18 15:35:55,980 INFO L226 Difference]: Without dead ends: 7479 [2022-02-18 15:35:55,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2022-02-18 15:35:55,981 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 901 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:55,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [901 Valid, 1597 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:35:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2022-02-18 15:35:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 2545. [2022-02-18 15:35:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2537 states have (on average 1.9590067008277494) internal successors, (4970), 2544 states have internal predecessors, (4970), 0 states have call successors, (0), 0 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-18 15:35:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4970 transitions. [2022-02-18 15:35:56,031 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4970 transitions. Word has length 105 [2022-02-18 15:35:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:56,031 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 4970 transitions. [2022-02-18 15:35:56,031 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-18 15:35:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4970 transitions. [2022-02-18 15:35:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:56,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:56,033 INFO L514 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-18 15:35:56,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-18 15:35:56,235 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-18 15:35:56,235 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash 703468234, now seen corresponding path program 13 times [2022-02-18 15:35:56,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:56,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995893128] [2022-02-18 15:35:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:56,551 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-18 15:35:56,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:56,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995893128] [2022-02-18 15:35:56,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995893128] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:56,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893951317] [2022-02-18 15:35:56,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:35:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:56,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:56,553 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-18 15:35:56,554 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-18 15:35:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:56,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:56,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:56,946 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-18 15:35:57,018 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-18 15:35:57,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:57,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893951317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:57,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:57,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:35:57,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479559744] [2022-02-18 15:35:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:57,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:57,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:57,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:57,019 INFO L87 Difference]: Start difference. First operand 2545 states and 4970 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-18 15:35:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:57,849 INFO L93 Difference]: Finished difference Result 7306 states and 14426 transitions. [2022-02-18 15:35:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-18 15:35:57,850 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-18 15:35:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:57,859 INFO L225 Difference]: With dead ends: 7306 [2022-02-18 15:35:57,859 INFO L226 Difference]: Without dead ends: 7306 [2022-02-18 15:35:57,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2022-02-18 15:35:57,860 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1189 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:57,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1363 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:35:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-02-18 15:35:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 2555. [2022-02-18 15:35:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2547 states have (on average 1.9591676482135847) internal successors, (4990), 2554 states have internal predecessors, (4990), 0 states have call successors, (0), 0 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-18 15:35:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-02-18 15:35:57,906 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-02-18 15:35:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:57,907 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-02-18 15:35:57,907 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-18 15:35:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-02-18 15:35:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:57,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:57,909 INFO L514 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-18 15:35:57,927 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-18 15:35:58,126 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-18 15:35:58,127 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash 135475764, now seen corresponding path program 14 times [2022-02-18 15:35:58,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:58,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599869111] [2022-02-18 15:35:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:58,433 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-18 15:35:58,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:58,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599869111] [2022-02-18 15:35:58,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599869111] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:58,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168225934] [2022-02-18 15:35:58,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:35:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:58,435 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-18 15:35:58,438 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-18 15:35:58,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:35:58,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:35:58,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:35:58,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:35:58,797 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-18 15:35:58,900 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-18 15:35:58,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:35:58,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168225934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:35:58,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:35:58,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:35:58,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754804125] [2022-02-18 15:35:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:35:58,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:35:58,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:35:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:35:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:35:58,902 INFO L87 Difference]: Start difference. First operand 2555 states and 4990 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-18 15:35:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:35:59,410 INFO L93 Difference]: Finished difference Result 7627 states and 15035 transitions. [2022-02-18 15:35:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-18 15:35:59,411 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-18 15:35:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:35:59,419 INFO L225 Difference]: With dead ends: 7627 [2022-02-18 15:35:59,419 INFO L226 Difference]: Without dead ends: 7627 [2022-02-18 15:35:59,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2022-02-18 15:35:59,420 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 865 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:35:59,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1427 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:35:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2022-02-18 15:35:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 2557. [2022-02-18 15:35:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2549 states have (on average 1.959199686151432) internal successors, (4994), 2556 states have internal predecessors, (4994), 0 states have call successors, (0), 0 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-18 15:35:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-02-18 15:35:59,461 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-02-18 15:35:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:35:59,461 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-02-18 15:35:59,461 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-18 15:35:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-02-18 15:35:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:35:59,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:35:59,462 INFO L514 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-18 15:35:59,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-18 15:35:59,675 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-18 15:35:59,675 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:35:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:35:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1586278210, now seen corresponding path program 15 times [2022-02-18 15:35:59,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:35:59,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951160372] [2022-02-18 15:35:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:35:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:35:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:35:59,939 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-18 15:35:59,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:35:59,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951160372] [2022-02-18 15:35:59,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951160372] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:35:59,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066605312] [2022-02-18 15:35:59,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:35:59,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:35:59,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:35:59,941 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-18 15:35:59,941 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-18 15:36:00,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:36:00,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:00,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:00,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:00,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-18 15:36:00,414 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-18 15:36:00,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:00,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066605312] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:00,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:00,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:00,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717444541] [2022-02-18 15:36:00,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:00,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:00,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:00,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:00,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:00,415 INFO L87 Difference]: Start difference. First operand 2557 states and 4994 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-18 15:36:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:01,241 INFO L93 Difference]: Finished difference Result 7669 states and 15095 transitions. [2022-02-18 15:36:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-18 15:36:01,242 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-18 15:36:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:01,252 INFO L225 Difference]: With dead ends: 7669 [2022-02-18 15:36:01,252 INFO L226 Difference]: Without dead ends: 7669 [2022-02-18 15:36:01,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2022-02-18 15:36:01,253 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 986 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:01,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 1501 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-02-18 15:36:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 2551. [2022-02-18 15:36:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2543 states have (on average 1.959103421156115) internal successors, (4982), 2550 states have internal predecessors, (4982), 0 states have call successors, (0), 0 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-18 15:36:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-02-18 15:36:01,304 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-02-18 15:36:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:01,304 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-02-18 15:36:01,304 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-18 15:36:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-02-18 15:36:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:01,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:01,306 INFO L514 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-18 15:36:01,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:01,506 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-18 15:36:01,506 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash -27754878, now seen corresponding path program 16 times [2022-02-18 15:36:01,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:01,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58334500] [2022-02-18 15:36:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:01,608 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-18 15:36:01,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:01,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58334500] [2022-02-18 15:36:01,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58334500] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:01,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498998787] [2022-02-18 15:36:01,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:36:01,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:01,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:01,610 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-18 15:36:01,637 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-18 15:36:01,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:36:01,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:01,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-18 15:36:01,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:02,003 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-18 15:36:02,119 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-18 15:36:02,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,149 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-18 15:36:02,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,184 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-18 15:36:02,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:02,231 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-18 15:36:02,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:02,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-18 15:36:02,288 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-18 15:36:02,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:02,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498998787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:02,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:02,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2022-02-18 15:36:02,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863500206] [2022-02-18 15:36:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:02,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-18 15:36:02,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-18 15:36:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-02-18 15:36:02,290 INFO L87 Difference]: Start difference. First operand 2551 states and 4982 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-18 15:36:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:02,974 INFO L93 Difference]: Finished difference Result 6873 states and 13572 transitions. [2022-02-18 15:36:02,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-18 15:36:02,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-18 15:36:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:02,983 INFO L225 Difference]: With dead ends: 6873 [2022-02-18 15:36:02,983 INFO L226 Difference]: Without dead ends: 6873 [2022-02-18 15:36:02,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=922, Unknown=0, NotChecked=0, Total=1260 [2022-02-18 15:36:02,984 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 744 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:02,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 1284 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2022-02-18 15:36:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 2556. [2022-02-18 15:36:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2548 states have (on average 1.9591836734693877) internal successors, (4992), 2555 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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-18 15:36:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4992 transitions. [2022-02-18 15:36:03,025 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4992 transitions. Word has length 105 [2022-02-18 15:36:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:03,025 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 4992 transitions. [2022-02-18 15:36:03,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-18 15:36:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4992 transitions. [2022-02-18 15:36:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:03,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:03,027 INFO L514 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-18 15:36:03,045 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-18 15:36:03,235 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-18 15:36:03,236 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 782515202, now seen corresponding path program 17 times [2022-02-18 15:36:03,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:03,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562091053] [2022-02-18 15:36:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:03,382 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-18 15:36:03,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:03,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562091053] [2022-02-18 15:36:03,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562091053] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:03,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686696587] [2022-02-18 15:36:03,382 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:36:03,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:03,383 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-18 15:36:03,384 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-18 15:36:03,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:36:03,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:03,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:03,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:03,760 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-18 15:36:03,819 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-18 15:36:03,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:03,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686696587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:03,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:03,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:03,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659443135] [2022-02-18 15:36:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:03,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:03,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:03,821 INFO L87 Difference]: Start difference. First operand 2556 states and 4992 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-18 15:36:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:04,579 INFO L93 Difference]: Finished difference Result 7089 states and 13973 transitions. [2022-02-18 15:36:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-18 15:36:04,579 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-18 15:36:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:04,587 INFO L225 Difference]: With dead ends: 7089 [2022-02-18 15:36:04,587 INFO L226 Difference]: Without dead ends: 7089 [2022-02-18 15:36:04,587 INFO L932 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-18 15:36:04,588 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 1073 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:04,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1073 Valid, 1406 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-02-18 15:36:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2554. [2022-02-18 15:36:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2546 states have (on average 1.9591516103692066) internal successors, (4988), 2553 states have internal predecessors, (4988), 0 states have call successors, (0), 0 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-18 15:36:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-02-18 15:36:04,627 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-02-18 15:36:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:04,627 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-02-18 15:36:04,627 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-18 15:36:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-02-18 15:36:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:04,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:04,629 INFO L514 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-18 15:36:04,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:04,829 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-18 15:36:04,829 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:04,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash -612674444, now seen corresponding path program 18 times [2022-02-18 15:36:04,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:04,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322018226] [2022-02-18 15:36:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:05,098 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-18 15:36:05,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:05,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322018226] [2022-02-18 15:36:05,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322018226] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:05,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996276494] [2022-02-18 15:36:05,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:36:05,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:05,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:05,100 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-18 15:36:05,100 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-18 15:36:05,225 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-18 15:36:05,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:05,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:05,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:05,425 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-18 15:36:05,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-18 15:36:05,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:05,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996276494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:05,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:05,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:05,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693931316] [2022-02-18 15:36:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:05,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:05,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:05,530 INFO L87 Difference]: Start difference. First operand 2554 states and 4988 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-18 15:36:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:05,818 INFO L93 Difference]: Finished difference Result 4622 states and 9091 transitions. [2022-02-18 15:36:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 15:36:05,818 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-18 15:36:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:05,823 INFO L225 Difference]: With dead ends: 4622 [2022-02-18 15:36:05,824 INFO L226 Difference]: Without dead ends: 4622 [2022-02-18 15:36:05,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2022-02-18 15:36:05,824 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 458 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:05,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 1027 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:36:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-02-18 15:36:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2611. [2022-02-18 15:36:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2603 states have (on average 1.9600461006530925) internal successors, (5102), 2610 states have internal predecessors, (5102), 0 states have call successors, (0), 0 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-18 15:36:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 5102 transitions. [2022-02-18 15:36:05,861 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 5102 transitions. Word has length 105 [2022-02-18 15:36:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:05,861 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 5102 transitions. [2022-02-18 15:36:05,861 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-18 15:36:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 5102 transitions. [2022-02-18 15:36:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:05,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:05,863 INFO L514 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-18 15:36:05,880 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-18 15:36:06,080 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-18 15:36:06,080 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -830929600, now seen corresponding path program 19 times [2022-02-18 15:36:06,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:06,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224659757] [2022-02-18 15:36:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:06,190 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-18 15:36:06,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:06,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224659757] [2022-02-18 15:36:06,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224659757] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:06,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089357388] [2022-02-18 15:36:06,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:36:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:06,192 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-18 15:36:06,193 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-18 15:36:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:06,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:06,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:06,521 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-18 15:36:06,590 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-18 15:36:06,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:06,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089357388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:06,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:06,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:36:06,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606282296] [2022-02-18 15:36:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:06,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:06,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:06,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:06,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:36:06,591 INFO L87 Difference]: Start difference. First operand 2611 states and 5102 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-18 15:36:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:06,893 INFO L93 Difference]: Finished difference Result 5142 states and 10145 transitions. [2022-02-18 15:36:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 15:36:06,894 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-18 15:36:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:06,900 INFO L225 Difference]: With dead ends: 5142 [2022-02-18 15:36:06,900 INFO L226 Difference]: Without dead ends: 5142 [2022-02-18 15:36:06,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-02-18 15:36:06,900 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 559 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:06,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 1280 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:36:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-02-18 15:36:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 2626. [2022-02-18 15:36:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2618 states have (on average 1.9602750190985485) internal successors, (5132), 2625 states have internal predecessors, (5132), 0 states have call successors, (0), 0 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-18 15:36:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-02-18 15:36:06,938 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-02-18 15:36:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:06,938 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-02-18 15:36:06,938 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-18 15:36:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-02-18 15:36:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:06,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:06,940 INFO L514 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-18 15:36:06,957 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-18 15:36:07,145 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-18 15:36:07,145 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:07,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1817223392, now seen corresponding path program 20 times [2022-02-18 15:36:07,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:07,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484410819] [2022-02-18 15:36:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:07,447 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-18 15:36:07,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:07,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484410819] [2022-02-18 15:36:07,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484410819] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:07,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590624215] [2022-02-18 15:36:07,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:36:07,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:07,449 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-18 15:36:07,449 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-18 15:36:07,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:36:07,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:07,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:07,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:07,881 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-18 15:36:07,942 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-18 15:36:07,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:07,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590624215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:07,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:07,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:07,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843818150] [2022-02-18 15:36:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:07,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:07,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:07,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:07,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:07,943 INFO L87 Difference]: Start difference. First operand 2626 states and 5132 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-18 15:36:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:08,674 INFO L93 Difference]: Finished difference Result 6445 states and 12713 transitions. [2022-02-18 15:36:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-18 15:36:08,674 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-18 15:36:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:08,681 INFO L225 Difference]: With dead ends: 6445 [2022-02-18 15:36:08,681 INFO L226 Difference]: Without dead ends: 6445 [2022-02-18 15:36:08,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2022-02-18 15:36:08,682 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 959 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:08,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 1302 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-02-18 15:36:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 2623. [2022-02-18 15:36:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2615 states have (on average 1.9602294455066922) internal successors, (5126), 2622 states have internal predecessors, (5126), 0 states have call successors, (0), 0 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-18 15:36:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-02-18 15:36:08,717 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-02-18 15:36:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:08,718 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-02-18 15:36:08,718 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-18 15:36:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-02-18 15:36:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:08,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:08,719 INFO L514 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-18 15:36:08,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:08,931 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-18 15:36:08,931 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash -315350844, now seen corresponding path program 21 times [2022-02-18 15:36:08,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:08,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131172832] [2022-02-18 15:36:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:09,212 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-18 15:36:09,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:09,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131172832] [2022-02-18 15:36:09,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131172832] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:09,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551803348] [2022-02-18 15:36:09,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:36:09,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:09,214 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-18 15:36:09,214 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-18 15:36:09,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:36:09,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:09,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:09,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:09,607 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-18 15:36:09,669 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-18 15:36:09,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:09,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551803348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:09,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:09,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:09,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493139754] [2022-02-18 15:36:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:09,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:09,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:09,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:09,675 INFO L87 Difference]: Start difference. First operand 2623 states and 5126 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-18 15:36:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:10,526 INFO L93 Difference]: Finished difference Result 8268 states and 16326 transitions. [2022-02-18 15:36:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-18 15:36:10,527 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-18 15:36:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:10,535 INFO L225 Difference]: With dead ends: 8268 [2022-02-18 15:36:10,535 INFO L226 Difference]: Without dead ends: 8268 [2022-02-18 15:36:10,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=2011, Unknown=0, NotChecked=0, Total=2352 [2022-02-18 15:36:10,536 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 1119 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:10,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1119 Valid, 1704 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2022-02-18 15:36:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 2627. [2022-02-18 15:36:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2619 states have (on average 1.9602901870943108) internal successors, (5134), 2626 states have internal predecessors, (5134), 0 states have call successors, (0), 0 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-18 15:36:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-02-18 15:36:10,580 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-02-18 15:36:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:10,581 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-02-18 15:36:10,581 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-18 15:36:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-02-18 15:36:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:10,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:10,582 INFO L514 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-18 15:36:10,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-02-18 15:36:10,782 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-18 15:36:10,783 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:10,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash -883343314, now seen corresponding path program 22 times [2022-02-18 15:36:10,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:10,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648889786] [2022-02-18 15:36:10,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:10,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:11,066 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-18 15:36:11,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:11,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648889786] [2022-02-18 15:36:11,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648889786] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:11,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886417643] [2022-02-18 15:36:11,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:36:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:11,068 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-18 15:36:11,069 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-18 15:36:11,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:36:11,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:11,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-18 15:36:11,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:11,435 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-18 15:36:11,494 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-18 15:36:11,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:11,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886417643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:11,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:11,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-02-18 15:36:11,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555681973] [2022-02-18 15:36:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:11,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-18 15:36:11,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-18 15:36:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-02-18 15:36:11,495 INFO L87 Difference]: Start difference. First operand 2627 states and 5134 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-18 15:36:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:12,076 INFO L93 Difference]: Finished difference Result 7769 states and 15347 transitions. [2022-02-18 15:36:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-18 15:36:12,077 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-18 15:36:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:12,086 INFO L225 Difference]: With dead ends: 7769 [2022-02-18 15:36:12,086 INFO L226 Difference]: Without dead ends: 7769 [2022-02-18 15:36:12,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2022-02-18 15:36:12,087 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 991 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:12,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [991 Valid, 1449 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7769 states. [2022-02-18 15:36:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7769 to 2629. [2022-02-18 15:36:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2621 states have (on average 1.9603204883632201) internal successors, (5138), 2628 states have internal predecessors, (5138), 0 states have call successors, (0), 0 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-18 15:36:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-02-18 15:36:12,132 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-02-18 15:36:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:12,132 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-02-18 15:36:12,132 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-18 15:36:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-02-18 15:36:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:12,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:12,134 INFO L514 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-18 15:36:12,151 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-18 15:36:12,351 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-18 15:36:12,351 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash 567459132, now seen corresponding path program 23 times [2022-02-18 15:36:12,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:12,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916181373] [2022-02-18 15:36:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:12,646 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-18 15:36:12,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:12,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916181373] [2022-02-18 15:36:12,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916181373] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:12,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234357423] [2022-02-18 15:36:12,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:36:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:12,647 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-18 15:36:12,649 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-18 15:36:12,826 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:36:12,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:12,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:12,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:13,068 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-18 15:36:13,131 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-18 15:36:13,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:13,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234357423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:13,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:13,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:13,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959732322] [2022-02-18 15:36:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:13,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:13,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:13,132 INFO L87 Difference]: Start difference. First operand 2629 states and 5138 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-18 15:36:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:13,952 INFO L93 Difference]: Finished difference Result 6754 states and 13293 transitions. [2022-02-18 15:36:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-18 15:36:13,952 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-18 15:36:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:13,961 INFO L225 Difference]: With dead ends: 6754 [2022-02-18 15:36:13,961 INFO L226 Difference]: Without dead ends: 6754 [2022-02-18 15:36:13,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2022-02-18 15:36:13,962 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 881 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:13,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 1694 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2022-02-18 15:36:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 2617. [2022-02-18 15:36:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2609 states have (on average 1.9601379839018782) internal successors, (5114), 2616 states have internal predecessors, (5114), 0 states have call successors, (0), 0 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-18 15:36:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-02-18 15:36:14,006 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-02-18 15:36:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:14,006 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-02-18 15:36:14,006 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-18 15:36:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-02-18 15:36:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:14,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:14,007 INFO L514 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-18 15:36:14,024 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-18 15:36:14,208 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-18 15:36:14,208 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1968483042, now seen corresponding path program 24 times [2022-02-18 15:36:14,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:14,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148600803] [2022-02-18 15:36:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:14,372 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-18 15:36:14,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:14,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148600803] [2022-02-18 15:36:14,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148600803] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:14,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878476211] [2022-02-18 15:36:14,373 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:36:14,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:14,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:14,388 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-18 15:36:14,389 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-18 15:36:14,546 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-18 15:36:14,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:14,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:14,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:14,768 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-18 15:36:14,827 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-18 15:36:14,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:14,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878476211] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:14,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:14,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:14,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695881097] [2022-02-18 15:36:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:14,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:14,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:14,829 INFO L87 Difference]: Start difference. First operand 2617 states and 5114 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-18 15:36:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:15,667 INFO L93 Difference]: Finished difference Result 7944 states and 15678 transitions. [2022-02-18 15:36:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-18 15:36:15,667 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-18 15:36:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:15,677 INFO L225 Difference]: With dead ends: 7944 [2022-02-18 15:36:15,677 INFO L226 Difference]: Without dead ends: 7944 [2022-02-18 15:36:15,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2022-02-18 15:36:15,678 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 1151 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:15,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 1638 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-02-18 15:36:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 2627. [2022-02-18 15:36:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2619 states have (on average 1.9602901870943108) internal successors, (5134), 2626 states have internal predecessors, (5134), 0 states have call successors, (0), 0 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-18 15:36:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-02-18 15:36:15,730 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-02-18 15:36:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:15,730 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-02-18 15:36:15,730 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-18 15:36:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-02-18 15:36:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:15,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:15,732 INFO L514 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-18 15:36:15,748 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-18 15:36:15,932 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-18 15:36:15,932 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1400490572, now seen corresponding path program 25 times [2022-02-18 15:36:15,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:15,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598624576] [2022-02-18 15:36:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:16,081 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-18 15:36:16,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:16,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598624576] [2022-02-18 15:36:16,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598624576] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:16,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368651378] [2022-02-18 15:36:16,081 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:36:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:16,083 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-18 15:36:16,116 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-18 15:36:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:16,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:16,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:16,482 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-18 15:36:16,553 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-18 15:36:16,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:16,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368651378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:16,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:16,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:16,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433754313] [2022-02-18 15:36:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:16,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:16,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:16,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:16,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:16,554 INFO L87 Difference]: Start difference. First operand 2627 states and 5134 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-18 15:36:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:17,055 INFO L93 Difference]: Finished difference Result 8265 states and 16287 transitions. [2022-02-18 15:36:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-18 15:36:17,056 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-18 15:36:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:17,067 INFO L225 Difference]: With dead ends: 8265 [2022-02-18 15:36:17,067 INFO L226 Difference]: Without dead ends: 8265 [2022-02-18 15:36:17,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-02-18 15:36:17,068 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 886 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:17,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 1651 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2022-02-18 15:36:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 2629. [2022-02-18 15:36:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2621 states have (on average 1.9603204883632201) internal successors, (5138), 2628 states have internal predecessors, (5138), 0 states have call successors, (0), 0 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-18 15:36:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-02-18 15:36:17,122 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-02-18 15:36:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:17,123 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-02-18 15:36:17,123 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-18 15:36:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-02-18 15:36:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:17,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:17,124 INFO L514 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-18 15:36:17,141 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-18 15:36:17,324 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-18 15:36:17,325 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1443674278, now seen corresponding path program 26 times [2022-02-18 15:36:17,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:17,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022075275] [2022-02-18 15:36:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:17,477 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-18 15:36:17,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:17,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022075275] [2022-02-18 15:36:17,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022075275] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:17,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135990625] [2022-02-18 15:36:17,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:36:17,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:17,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:17,479 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-18 15:36:17,495 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-18 15:36:17,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:36:17,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:17,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:17,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:17,855 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-18 15:36:17,916 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-18 15:36:17,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:17,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135990625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:17,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:17,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:17,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179761871] [2022-02-18 15:36:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:17,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:17,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:17,918 INFO L87 Difference]: Start difference. First operand 2629 states and 5138 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-18 15:36:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:18,771 INFO L93 Difference]: Finished difference Result 8307 states and 16347 transitions. [2022-02-18 15:36:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-18 15:36:18,771 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-18 15:36:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:18,780 INFO L225 Difference]: With dead ends: 8307 [2022-02-18 15:36:18,781 INFO L226 Difference]: Without dead ends: 8307 [2022-02-18 15:36:18,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2022-02-18 15:36:18,781 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 954 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:18,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 1698 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2022-02-18 15:36:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 2623. [2022-02-18 15:36:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2615 states have (on average 1.9602294455066922) internal successors, (5126), 2622 states have internal predecessors, (5126), 0 states have call successors, (0), 0 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-18 15:36:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-02-18 15:36:18,826 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-02-18 15:36:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:18,826 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-02-18 15:36:18,826 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-18 15:36:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-02-18 15:36:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:18,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:18,827 INFO L514 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-18 15:36:18,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:19,028 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-18 15:36:19,028 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1237259930, now seen corresponding path program 27 times [2022-02-18 15:36:19,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:19,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285531584] [2022-02-18 15:36:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:19,159 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-18 15:36:19,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:19,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285531584] [2022-02-18 15:36:19,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285531584] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:19,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868353868] [2022-02-18 15:36:19,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:36:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:19,161 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-18 15:36:19,185 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-18 15:36:19,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:36:19,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:19,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:19,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:19,512 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-18 15:36:19,593 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-18 15:36:19,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:19,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868353868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:19,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:19,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:36:19,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665118859] [2022-02-18 15:36:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:19,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:19,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:36:19,594 INFO L87 Difference]: Start difference. First operand 2623 states and 5126 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-18 15:36:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:20,088 INFO L93 Difference]: Finished difference Result 7504 states and 14817 transitions. [2022-02-18 15:36:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-18 15:36:20,088 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-18 15:36:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:20,097 INFO L225 Difference]: With dead ends: 7504 [2022-02-18 15:36:20,097 INFO L226 Difference]: Without dead ends: 7504 [2022-02-18 15:36:20,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-02-18 15:36:20,098 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 748 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:20,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 1535 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2022-02-18 15:36:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 2628. [2022-02-18 15:36:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2620 states have (on average 1.9603053435114504) internal successors, (5136), 2627 states have internal predecessors, (5136), 0 states have call successors, (0), 0 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-18 15:36:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 5136 transitions. [2022-02-18 15:36:20,159 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 5136 transitions. Word has length 105 [2022-02-18 15:36:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:20,159 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 5136 transitions. [2022-02-18 15:36:20,159 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-18 15:36:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 5136 transitions. [2022-02-18 15:36:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:20,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:20,160 INFO L514 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-18 15:36:20,177 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-18 15:36:20,361 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-18 15:36:20,361 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2047530010, now seen corresponding path program 28 times [2022-02-18 15:36:20,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:20,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327530783] [2022-02-18 15:36:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:20,516 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-18 15:36:20,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:20,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327530783] [2022-02-18 15:36:20,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327530783] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:20,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079994872] [2022-02-18 15:36:20,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:36:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:20,517 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-18 15:36:20,518 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-18 15:36:20,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:36:20,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:20,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-18 15:36:20,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:20,976 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-18 15:36:21,106 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-18 15:36:21,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,135 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-18 15:36:21,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,176 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-18 15:36:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,233 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-18 15:36:21,274 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-18 15:36:21,274 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 19 treesize of output 11 [2022-02-18 15:36:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:21,368 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 15:36:21,369 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 6 case distinctions, treesize of input 46 treesize of output 54 [2022-02-18 15:36:21,393 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-18 15:36:21,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:21,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079994872] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:21,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:21,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-02-18 15:36:21,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370441571] [2022-02-18 15:36:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:21,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 15:36:21,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 15:36:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-02-18 15:36:21,395 INFO L87 Difference]: Start difference. First operand 2628 states and 5136 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-18 15:36:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:23,280 INFO L93 Difference]: Finished difference Result 7649 states and 15107 transitions. [2022-02-18 15:36:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-18 15:36:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-18 15:36:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:23,288 INFO L225 Difference]: With dead ends: 7649 [2022-02-18 15:36:23,288 INFO L226 Difference]: Without dead ends: 7649 [2022-02-18 15:36:23,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=556, Invalid=2200, Unknown=0, NotChecked=0, Total=2756 [2022-02-18 15:36:23,289 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 966 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:23,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 2044 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-18 15:36:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2022-02-18 15:36:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 2648. [2022-02-18 15:36:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2640 states have (on average 1.9606060606060607) internal successors, (5176), 2647 states have internal predecessors, (5176), 0 states have call successors, (0), 0 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-18 15:36:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 5176 transitions. [2022-02-18 15:36:23,328 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 5176 transitions. Word has length 105 [2022-02-18 15:36:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:23,328 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 5176 transitions. [2022-02-18 15:36:23,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-18 15:36:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 5176 transitions. [2022-02-18 15:36:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:23,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:23,329 INFO L514 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-18 15:36:23,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:23,530 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-18 15:36:23,530 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1665619056, now seen corresponding path program 29 times [2022-02-18 15:36:23,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:23,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350856552] [2022-02-18 15:36:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:23,796 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-18 15:36:23,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:23,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350856552] [2022-02-18 15:36:23,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350856552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:23,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426392053] [2022-02-18 15:36:23,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:36:23,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:23,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:23,798 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-18 15:36:23,799 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-18 15:36:23,997 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:36:23,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:23,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:24,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:24,244 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-18 15:36:24,304 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-18 15:36:24,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:24,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426392053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:24,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:24,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:24,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602074684] [2022-02-18 15:36:24,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:24,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:24,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:24,305 INFO L87 Difference]: Start difference. First operand 2648 states and 5176 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-18 15:36:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:25,133 INFO L93 Difference]: Finished difference Result 7727 states and 15225 transitions. [2022-02-18 15:36:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-18 15:36:25,133 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-18 15:36:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:25,143 INFO L225 Difference]: With dead ends: 7727 [2022-02-18 15:36:25,143 INFO L226 Difference]: Without dead ends: 7727 [2022-02-18 15:36:25,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2022-02-18 15:36:25,144 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1070 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:25,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 1538 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2022-02-18 15:36:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 2626. [2022-02-18 15:36:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2618 states have (on average 1.9602750190985485) internal successors, (5132), 2625 states have internal predecessors, (5132), 0 states have call successors, (0), 0 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-18 15:36:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-02-18 15:36:25,196 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-02-18 15:36:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:25,196 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-02-18 15:36:25,196 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-18 15:36:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-02-18 15:36:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:25,198 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:25,198 INFO L514 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-18 15:36:25,215 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-18 15:36:25,401 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-18 15:36:25,401 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 652340364, now seen corresponding path program 30 times [2022-02-18 15:36:25,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:25,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280618430] [2022-02-18 15:36:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:25,660 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-18 15:36:25,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:25,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280618430] [2022-02-18 15:36:25,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280618430] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:25,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068335317] [2022-02-18 15:36:25,661 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:36:25,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:25,662 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-18 15:36:25,663 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-18 15:36:25,852 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-18 15:36:25,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:25,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:25,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:26,053 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-18 15:36:26,158 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-18 15:36:26,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:26,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068335317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:26,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:26,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:26,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185135784] [2022-02-18 15:36:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:26,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:26,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:26,159 INFO L87 Difference]: Start difference. First operand 2626 states and 5132 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-18 15:36:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:26,489 INFO L93 Difference]: Finished difference Result 5260 states and 10343 transitions. [2022-02-18 15:36:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 15:36:26,489 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-18 15:36:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:26,494 INFO L225 Difference]: With dead ends: 5260 [2022-02-18 15:36:26,494 INFO L226 Difference]: Without dead ends: 5260 [2022-02-18 15:36:26,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2022-02-18 15:36:26,495 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 452 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:26,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 1387 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:36:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2022-02-18 15:36:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 2608. [2022-02-18 15:36:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2600 states have (on average 1.96) internal successors, (5096), 2607 states have internal predecessors, (5096), 0 states have call successors, (0), 0 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-18 15:36:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-02-18 15:36:26,525 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-02-18 15:36:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:26,526 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-02-18 15:36:26,526 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-18 15:36:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-02-18 15:36:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:26,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:26,527 INFO L514 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-18 15:36:26,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:26,744 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-18 15:36:26,744 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash 564648876, now seen corresponding path program 31 times [2022-02-18 15:36:26,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:26,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134096905] [2022-02-18 15:36:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:27,032 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-18 15:36:27,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:27,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134096905] [2022-02-18 15:36:27,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134096905] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:27,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987990333] [2022-02-18 15:36:27,032 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:36:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:27,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:27,033 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-18 15:36:27,050 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-18 15:36:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:27,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:27,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:27,466 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-18 15:36:27,528 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-18 15:36:27,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:27,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987990333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:27,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:27,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:27,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969577147] [2022-02-18 15:36:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:27,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:27,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:27,529 INFO L87 Difference]: Start difference. First operand 2608 states and 5096 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-18 15:36:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:28,471 INFO L93 Difference]: Finished difference Result 6726 states and 13266 transitions. [2022-02-18 15:36:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-18 15:36:28,472 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-18 15:36:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:28,480 INFO L225 Difference]: With dead ends: 6726 [2022-02-18 15:36:28,480 INFO L226 Difference]: Without dead ends: 6726 [2022-02-18 15:36:28,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=2169, Unknown=0, NotChecked=0, Total=2550 [2022-02-18 15:36:28,481 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1246 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:28,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1594 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2022-02-18 15:36:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 2616. [2022-02-18 15:36:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2608 states have (on average 1.960122699386503) internal successors, (5112), 2615 states have internal predecessors, (5112), 0 states have call successors, (0), 0 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-18 15:36:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 5112 transitions. [2022-02-18 15:36:28,534 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 5112 transitions. Word has length 105 [2022-02-18 15:36:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:28,534 INFO L470 AbstractCegarLoop]: Abstraction has 2616 states and 5112 transitions. [2022-02-18 15:36:28,534 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-18 15:36:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 5112 transitions. [2022-02-18 15:36:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:28,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:28,536 INFO L514 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-18 15:36:28,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:28,742 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-18 15:36:28,742 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -3343594, now seen corresponding path program 32 times [2022-02-18 15:36:28,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:28,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447593216] [2022-02-18 15:36:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:28,877 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-18 15:36:28,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:28,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447593216] [2022-02-18 15:36:28,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447593216] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:28,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212765740] [2022-02-18 15:36:28,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:36:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:28,878 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-18 15:36:28,882 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-18 15:36:29,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:36:29,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:29,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:29,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:29,247 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-18 15:36:29,319 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-18 15:36:29,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:29,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212765740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:29,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:29,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:29,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658222921] [2022-02-18 15:36:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:29,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:29,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:29,320 INFO L87 Difference]: Start difference. First operand 2616 states and 5112 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-18 15:36:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:29,827 INFO L93 Difference]: Finished difference Result 7047 states and 13875 transitions. [2022-02-18 15:36:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-18 15:36:29,828 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-18 15:36:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:29,836 INFO L225 Difference]: With dead ends: 7047 [2022-02-18 15:36:29,837 INFO L226 Difference]: Without dead ends: 7047 [2022-02-18 15:36:29,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2022-02-18 15:36:29,837 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 940 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:29,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 1574 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:36:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2022-02-18 15:36:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 2618. [2022-02-18 15:36:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2610 states have (on average 1.9601532567049809) internal successors, (5116), 2617 states have internal predecessors, (5116), 0 states have call successors, (0), 0 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-18 15:36:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 5116 transitions. [2022-02-18 15:36:29,884 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 5116 transitions. Word has length 105 [2022-02-18 15:36:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:29,884 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 5116 transitions. [2022-02-18 15:36:29,884 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-18 15:36:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 5116 transitions. [2022-02-18 15:36:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:29,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:29,885 INFO L514 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-18 15:36:29,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-02-18 15:36:30,086 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-18 15:36:30,086 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1447458852, now seen corresponding path program 33 times [2022-02-18 15:36:30,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:30,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566938183] [2022-02-18 15:36:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:30,341 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-18 15:36:30,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:30,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566938183] [2022-02-18 15:36:30,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566938183] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:30,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167065715] [2022-02-18 15:36:30,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:36:30,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:30,342 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-18 15:36:30,343 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-18 15:36:30,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:36:30,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:30,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:30,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:30,785 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-18 15:36:30,853 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-18 15:36:30,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:30,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167065715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:30,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:30,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:30,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26367359] [2022-02-18 15:36:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:30,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:30,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:30,854 INFO L87 Difference]: Start difference. First operand 2618 states and 5116 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-18 15:36:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:31,759 INFO L93 Difference]: Finished difference Result 7089 states and 13935 transitions. [2022-02-18 15:36:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-18 15:36:31,760 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-18 15:36:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:31,768 INFO L225 Difference]: With dead ends: 7089 [2022-02-18 15:36:31,768 INFO L226 Difference]: Without dead ends: 7089 [2022-02-18 15:36:31,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2022-02-18 15:36:31,769 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 1032 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:31,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 1643 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-02-18 15:36:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2612. [2022-02-18 15:36:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2604 states have (on average 1.9600614439324118) internal successors, (5104), 2611 states have internal predecessors, (5104), 0 states have call successors, (0), 0 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-18 15:36:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 5104 transitions. [2022-02-18 15:36:31,813 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 5104 transitions. Word has length 105 [2022-02-18 15:36:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:31,813 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 5104 transitions. [2022-02-18 15:36:31,813 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-18 15:36:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 5104 transitions. [2022-02-18 15:36:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:31,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:31,815 INFO L514 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-18 15:36:31,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-02-18 15:36:32,027 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-18 15:36:32,027 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:32,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -166574236, now seen corresponding path program 34 times [2022-02-18 15:36:32,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:32,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158950693] [2022-02-18 15:36:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:32,313 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-18 15:36:32,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:32,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158950693] [2022-02-18 15:36:32,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158950693] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:32,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813842099] [2022-02-18 15:36:32,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:36:32,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:32,315 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-18 15:36:32,353 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-18 15:36:32,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:36:32,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:32,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-18 15:36:32,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:32,798 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-18 15:36:32,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-18 15:36:32,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:32,984 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-18 15:36:33,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,025 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-18 15:36:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,070 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-18 15:36:33,125 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-18 15:36:33,126 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 19 treesize of output 11 [2022-02-18 15:36:33,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:33,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 15:36:33,225 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 6 case distinctions, treesize of input 52 treesize of output 60 [2022-02-18 15:36:33,256 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-18 15:36:33,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:33,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813842099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:33,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:33,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2022-02-18 15:36:33,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373986931] [2022-02-18 15:36:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:33,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-18 15:36:33,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-18 15:36:33,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-02-18 15:36:33,258 INFO L87 Difference]: Start difference. First operand 2612 states and 5104 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-18 15:36:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:34,797 INFO L93 Difference]: Finished difference Result 8798 states and 17396 transitions. [2022-02-18 15:36:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-18 15:36:34,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-18 15:36:34,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:34,807 INFO L225 Difference]: With dead ends: 8798 [2022-02-18 15:36:34,807 INFO L226 Difference]: Without dead ends: 8798 [2022-02-18 15:36:34,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=475, Invalid=2605, Unknown=0, NotChecked=0, Total=3080 [2022-02-18 15:36:34,808 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 1053 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:34,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 2125 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-18 15:36:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2022-02-18 15:36:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 2658. [2022-02-18 15:36:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2650 states have (on average 1.9607547169811321) internal successors, (5196), 2657 states have internal predecessors, (5196), 0 states have call successors, (0), 0 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-18 15:36:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 5196 transitions. [2022-02-18 15:36:34,856 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 5196 transitions. Word has length 105 [2022-02-18 15:36:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:34,857 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 5196 transitions. [2022-02-18 15:36:34,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 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-18 15:36:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 5196 transitions. [2022-02-18 15:36:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:34,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:34,858 INFO L514 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-18 15:36:34,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-02-18 15:36:35,058 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-18 15:36:35,059 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:35,059 INFO L85 PathProgramCache]: Analyzing trace with hash 415243994, now seen corresponding path program 35 times [2022-02-18 15:36:35,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:35,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113580922] [2022-02-18 15:36:35,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:35,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:35,304 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-18 15:36:35,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:35,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113580922] [2022-02-18 15:36:35,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113580922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:35,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626192058] [2022-02-18 15:36:35,305 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:36:35,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:35,306 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-18 15:36:35,306 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-18 15:36:35,516 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:36:35,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:35,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:35,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:35,778 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-18 15:36:35,858 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-18 15:36:35,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:35,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626192058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:35,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:35,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-02-18 15:36:35,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020433908] [2022-02-18 15:36:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:35,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:35,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-02-18 15:36:35,860 INFO L87 Difference]: Start difference. First operand 2658 states and 5196 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-18 15:36:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:36,408 INFO L93 Difference]: Finished difference Result 7844 states and 15465 transitions. [2022-02-18 15:36:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-18 15:36:36,408 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-18 15:36:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:36,418 INFO L225 Difference]: With dead ends: 7844 [2022-02-18 15:36:36,418 INFO L226 Difference]: Without dead ends: 7844 [2022-02-18 15:36:36,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2022-02-18 15:36:36,419 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 840 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:36,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 1569 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-02-18 15:36:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 2617. [2022-02-18 15:36:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2609 states have (on average 1.9601379839018782) internal successors, (5114), 2616 states have internal predecessors, (5114), 0 states have call successors, (0), 0 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-18 15:36:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-02-18 15:36:36,481 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-02-18 15:36:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:36,481 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-02-18 15:36:36,481 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-18 15:36:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-02-18 15:36:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:36,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:36,483 INFO L514 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-18 15:36:36,500 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-18 15:36:36,683 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-18 15:36:36,683 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash 643695844, now seen corresponding path program 36 times [2022-02-18 15:36:36,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:36,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62945693] [2022-02-18 15:36:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:36,771 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-18 15:36:36,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:36,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62945693] [2022-02-18 15:36:36,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62945693] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:36,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984698361] [2022-02-18 15:36:36,772 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:36:36,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:36,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:36,773 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-18 15:36:36,774 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-18 15:36:36,969 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-02-18 15:36:36,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:36,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:36,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:37,195 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-18 15:36:37,258 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-18 15:36:37,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:37,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984698361] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:37,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:37,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:36:37,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513717498] [2022-02-18 15:36:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:37,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:37,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:37,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:37,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:36:37,259 INFO L87 Difference]: Start difference. First operand 2617 states and 5114 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-18 15:36:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:38,068 INFO L93 Difference]: Finished difference Result 8063 states and 15869 transitions. [2022-02-18 15:36:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-18 15:36:38,069 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-18 15:36:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:38,078 INFO L225 Difference]: With dead ends: 8063 [2022-02-18 15:36:38,078 INFO L226 Difference]: Without dead ends: 8063 [2022-02-18 15:36:38,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2022-02-18 15:36:38,079 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 1196 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:38,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 1497 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2022-02-18 15:36:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 2615. [2022-02-18 15:36:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2607 states have (on average 1.9601074031453778) internal successors, (5110), 2614 states have internal predecessors, (5110), 0 states have call successors, (0), 0 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-18 15:36:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5110 transitions. [2022-02-18 15:36:38,125 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5110 transitions. Word has length 105 [2022-02-18 15:36:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:38,125 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 5110 transitions. [2022-02-18 15:36:38,125 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-18 15:36:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5110 transitions. [2022-02-18 15:36:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:38,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:38,127 INFO L514 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-18 15:36:38,143 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-18 15:36:38,327 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-18 15:36:38,327 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -751493802, now seen corresponding path program 37 times [2022-02-18 15:36:38,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:38,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179869112] [2022-02-18 15:36:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:38,461 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-18 15:36:38,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:38,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179869112] [2022-02-18 15:36:38,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179869112] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:38,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705470886] [2022-02-18 15:36:38,461 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:36:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:38,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:38,462 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-18 15:36:38,463 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-18 15:36:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:38,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:38,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:38,841 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-18 15:36:38,932 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-18 15:36:38,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:38,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705470886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:38,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:38,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:36:38,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531306468] [2022-02-18 15:36:38,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:38,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:38,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:36:38,934 INFO L87 Difference]: Start difference. First operand 2615 states and 5110 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-18 15:36:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:39,268 INFO L93 Difference]: Finished difference Result 5596 states and 10987 transitions. [2022-02-18 15:36:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-18 15:36:39,268 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-18 15:36:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:39,276 INFO L225 Difference]: With dead ends: 5596 [2022-02-18 15:36:39,276 INFO L226 Difference]: Without dead ends: 5596 [2022-02-18 15:36:39,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-02-18 15:36:39,276 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 562 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:39,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1354 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:36:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-02-18 15:36:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 2606. [2022-02-18 15:36:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2598 states have (on average 1.959969207082371) internal successors, (5092), 2605 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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-18 15:36:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 5092 transitions. [2022-02-18 15:36:39,317 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 5092 transitions. Word has length 105 [2022-02-18 15:36:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:39,317 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 5092 transitions. [2022-02-18 15:36:39,317 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-18 15:36:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 5092 transitions. [2022-02-18 15:36:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:39,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:39,319 INFO L514 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-18 15:36:39,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-02-18 15:36:39,519 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-18 15:36:39,519 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1780597932, now seen corresponding path program 38 times [2022-02-18 15:36:39,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:39,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277110209] [2022-02-18 15:36:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:39,666 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-18 15:36:39,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:39,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277110209] [2022-02-18 15:36:39,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277110209] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:39,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499798151] [2022-02-18 15:36:39,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:36:39,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:39,668 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-18 15:36:39,669 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-18 15:36:39,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 15:36:39,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:39,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:39,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:40,083 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-18 15:36:40,157 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-18 15:36:40,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:40,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499798151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:40,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:40,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:40,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292115880] [2022-02-18 15:36:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:40,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:40,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:40,158 INFO L87 Difference]: Start difference. First operand 2606 states and 5092 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-18 15:36:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:40,689 INFO L93 Difference]: Finished difference Result 6301 states and 12435 transitions. [2022-02-18 15:36:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-18 15:36:40,689 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-18 15:36:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:40,700 INFO L225 Difference]: With dead ends: 6301 [2022-02-18 15:36:40,700 INFO L226 Difference]: Without dead ends: 6301 [2022-02-18 15:36:40,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-02-18 15:36:40,700 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 822 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:40,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [822 Valid, 1425 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2022-02-18 15:36:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 2610. [2022-02-18 15:36:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2602 states have (on average 1.9600307455803228) internal successors, (5100), 2609 states have internal predecessors, (5100), 0 states have call successors, (0), 0 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-18 15:36:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 5100 transitions. [2022-02-18 15:36:40,737 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 5100 transitions. Word has length 105 [2022-02-18 15:36:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:40,737 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 5100 transitions. [2022-02-18 15:36:40,737 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-18 15:36:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 5100 transitions. [2022-02-18 15:36:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:40,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:40,738 INFO L514 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-18 15:36:40,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:40,939 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-18 15:36:40,939 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1704099284, now seen corresponding path program 39 times [2022-02-18 15:36:40,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:40,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333565190] [2022-02-18 15:36:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:41,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-18 15:36:41,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:41,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333565190] [2022-02-18 15:36:41,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333565190] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:41,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724391072] [2022-02-18 15:36:41,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:36:41,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:41,027 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-18 15:36:41,030 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-18 15:36:41,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-18 15:36:41,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:41,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:41,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:41,437 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-18 15:36:41,494 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-18 15:36:41,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:41,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724391072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:41,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:41,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-02-18 15:36:41,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273862761] [2022-02-18 15:36:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:41,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:41,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:41,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-02-18 15:36:41,496 INFO L87 Difference]: Start difference. First operand 2610 states and 5100 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-18 15:36:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:42,304 INFO L93 Difference]: Finished difference Result 6524 states and 12843 transitions. [2022-02-18 15:36:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-18 15:36:42,304 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-18 15:36:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:42,311 INFO L225 Difference]: With dead ends: 6524 [2022-02-18 15:36:42,311 INFO L226 Difference]: Without dead ends: 6524 [2022-02-18 15:36:42,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-02-18 15:36:42,312 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1253 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:42,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1253 Valid, 1386 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-18 15:36:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2022-02-18 15:36:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 2608. [2022-02-18 15:36:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2600 states have (on average 1.96) internal successors, (5096), 2607 states have internal predecessors, (5096), 0 states have call successors, (0), 0 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-18 15:36:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-02-18 15:36:42,361 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-02-18 15:36:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:42,361 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-02-18 15:36:42,361 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-18 15:36:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-02-18 15:36:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:42,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:42,362 INFO L514 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-18 15:36:42,379 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-18 15:36:42,563 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-18 15:36:42,563 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1195678366, now seen corresponding path program 40 times [2022-02-18 15:36:42,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:42,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578919491] [2022-02-18 15:36:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:42,706 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-18 15:36:42,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:42,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578919491] [2022-02-18 15:36:42,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578919491] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:42,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737847749] [2022-02-18 15:36:42,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:36:42,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:42,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:42,709 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-18 15:36:42,710 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-18 15:36:42,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:36:42,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:42,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-18 15:36:42,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:43,087 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-18 15:36:43,198 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-18 15:36:43,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,224 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-18 15:36:43,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,254 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-18 15:36:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:43,291 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-18 15:36:43,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-18 15:36:43,341 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-18 15:36:43,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:43,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737847749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:43,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:43,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 15 [2022-02-18 15:36:43,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949296635] [2022-02-18 15:36:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:43,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-18 15:36:43,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-18 15:36:43,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-02-18 15:36:43,342 INFO L87 Difference]: Start difference. First operand 2608 states and 5096 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-18 15:36:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:43,959 INFO L93 Difference]: Finished difference Result 5379 states and 10546 transitions. [2022-02-18 15:36:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-18 15:36:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-18 15:36:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:43,964 INFO L225 Difference]: With dead ends: 5379 [2022-02-18 15:36:43,965 INFO L226 Difference]: Without dead ends: 5379 [2022-02-18 15:36:43,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2022-02-18 15:36:43,965 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 628 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:43,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 1411 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-18 15:36:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-02-18 15:36:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2605. [2022-02-18 15:36:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2597 states have (on average 1.9599537928378898) internal successors, (5090), 2604 states have internal predecessors, (5090), 0 states have call successors, (0), 0 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-18 15:36:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 5090 transitions. [2022-02-18 15:36:43,998 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 5090 transitions. Word has length 105 [2022-02-18 15:36:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:43,999 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 5090 transitions. [2022-02-18 15:36:43,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 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-18 15:36:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 5090 transitions. [2022-02-18 15:36:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-18 15:36:44,000 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:44,000 INFO L514 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-18 15:36:44,017 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-18 15:36:44,200 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-18 15:36:44,201 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash 49907308, now seen corresponding path program 41 times [2022-02-18 15:36:44,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:44,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008327742] [2022-02-18 15:36:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:44,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:44,380 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-18 15:36:44,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:44,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008327742] [2022-02-18 15:36:44,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008327742] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:44,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384757475] [2022-02-18 15:36:44,382 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:36:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:44,383 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-18 15:36:44,384 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-18 15:36:44,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:36:44,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:44,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-18 15:36:44,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:44,774 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-18 15:36:44,884 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-18 15:36:44,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 15:36:44,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384757475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:44,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 15:36:44,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-02-18 15:36:44,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902609133] [2022-02-18 15:36:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:44,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 15:36:44,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 15:36:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-02-18 15:36:44,885 INFO L87 Difference]: Start difference. First operand 2605 states and 5090 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-18 15:36:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:45,199 INFO L93 Difference]: Finished difference Result 4902 states and 9651 transitions. [2022-02-18 15:36:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 15:36:45,199 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-18 15:36:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:45,205 INFO L225 Difference]: With dead ends: 4902 [2022-02-18 15:36:45,205 INFO L226 Difference]: Without dead ends: 4902 [2022-02-18 15:36:45,205 INFO L932 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-18 15:36:45,205 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 562 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:45,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1394 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 15:36:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-02-18 15:36:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 2634. [2022-02-18 15:36:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2626 states have (on average 1.9603960396039604) internal successors, (5148), 2633 states have internal predecessors, (5148), 0 states have call successors, (0), 0 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-18 15:36:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 5148 transitions. [2022-02-18 15:36:45,239 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 5148 transitions. Word has length 105 [2022-02-18 15:36:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:45,239 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 5148 transitions. [2022-02-18 15:36:45,239 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-18 15:36:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 5148 transitions. [2022-02-18 15:36:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-18 15:36:45,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:45,240 INFO L514 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-18 15:36:45,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:45,440 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-18 15:36:45,441 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash 225817577, now seen corresponding path program 1 times [2022-02-18 15:36:45,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:45,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638718300] [2022-02-18 15:36:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:45,492 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-18 15:36:45,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:45,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638718300] [2022-02-18 15:36:45,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638718300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 15:36:45,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 15:36:45,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-18 15:36:45,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329280614] [2022-02-18 15:36:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 15:36:45,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 15:36:45,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 15:36:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-18 15:36:45,493 INFO L87 Difference]: Start difference. First operand 2634 states and 5148 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-18 15:36:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:45,582 INFO L93 Difference]: Finished difference Result 2900 states and 5680 transitions. [2022-02-18 15:36:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-18 15:36:45,582 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-18 15:36:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:45,587 INFO L225 Difference]: With dead ends: 2900 [2022-02-18 15:36:45,588 INFO L226 Difference]: Without dead ends: 2753 [2022-02-18 15:36:45,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-18 15:36:45,588 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 128 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:45,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 366 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 15:36:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2022-02-18 15:36:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2211. [2022-02-18 15:36:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2204 states have (on average 1.9491833030852994) internal successors, (4296), 2210 states have internal predecessors, (4296), 0 states have call successors, (0), 0 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-18 15:36:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4296 transitions. [2022-02-18 15:36:45,612 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4296 transitions. Word has length 114 [2022-02-18 15:36:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:45,612 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 4296 transitions. [2022-02-18 15:36:45,612 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-18 15:36:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4296 transitions. [2022-02-18 15:36:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:36:45,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:45,614 INFO L514 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-18 15:36:45,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-18 15:36:45,614 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1779983633, now seen corresponding path program 1 times [2022-02-18 15:36:45,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:45,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010563993] [2022-02-18 15:36:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:45,859 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-18 15:36:45,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:45,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010563993] [2022-02-18 15:36:45,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010563993] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:45,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926137235] [2022-02-18 15:36:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:45,861 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-18 15:36:45,862 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-18 15:36:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:46,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-18 15:36:46,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:46,811 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-18 15:36:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,847 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-18 15:36:46,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,883 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-18 15:36:46,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:46,933 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-18 15:36:47,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:47,036 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-18 15:36:47,066 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-18 15:36:47,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:36:47,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:47,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:48,152 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-18 15:36:48,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926137235] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:36:48,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:36:48,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-18 15:36:48,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504533929] [2022-02-18 15:36:48,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:36:48,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-18 15:36:48,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:48,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-18 15:36:48,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-18 15:36:48,153 INFO L87 Difference]: Start difference. First operand 2211 states and 4296 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-18 15:36:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:51,111 INFO L93 Difference]: Finished difference Result 7926 states and 15628 transitions. [2022-02-18 15:36:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-18 15:36:51,111 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-18 15:36:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:51,121 INFO L225 Difference]: With dead ends: 7926 [2022-02-18 15:36:51,121 INFO L226 Difference]: Without dead ends: 7914 [2022-02-18 15:36:51,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-02-18 15:36:51,122 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 2423 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:51,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 3947 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2912 Invalid, 0 Unknown, 220 Unchecked, 1.3s Time] [2022-02-18 15:36:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-02-18 15:36:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 3015. [2022-02-18 15:36:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3015 states, 3008 states have (on average 1.9763962765957446) internal successors, (5945), 3014 states have internal predecessors, (5945), 0 states have call successors, (0), 0 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-18 15:36:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5945 transitions. [2022-02-18 15:36:51,165 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5945 transitions. Word has length 134 [2022-02-18 15:36:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:51,165 INFO L470 AbstractCegarLoop]: Abstraction has 3015 states and 5945 transitions. [2022-02-18 15:36:51,166 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-18 15:36:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5945 transitions. [2022-02-18 15:36:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:36:51,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:51,168 INFO L514 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-18 15:36:51,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:51,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:51,382 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2062391747, now seen corresponding path program 2 times [2022-02-18 15:36:51,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:51,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530615267] [2022-02-18 15:36:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:51,621 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-18 15:36:51,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:51,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530615267] [2022-02-18 15:36:51,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530615267] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:51,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004120050] [2022-02-18 15:36:51,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:36:51,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:51,622 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-18 15:36:51,623 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-18 15:36:51,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 15:36:51,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:36:51,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-18 15:36:51,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:52,480 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-18 15:36:52,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,517 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-18 15:36:52,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,565 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-18 15:36:52,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:52,636 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-18 15:36:52,757 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-02-18 15:36:52,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 59 [2022-02-18 15:36:52,788 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-18 15:36:52,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:36:53,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:53,820 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-18 15:36:53,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004120050] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:36:53,820 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:36:53,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-18 15:36:53,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193590143] [2022-02-18 15:36:53,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:36:53,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-18 15:36:53,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-18 15:36:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-18 15:36:53,821 INFO L87 Difference]: Start difference. First operand 3015 states and 5945 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-18 15:36:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:36:57,168 INFO L93 Difference]: Finished difference Result 7629 states and 15050 transitions. [2022-02-18 15:36:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-18 15:36:57,169 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-18 15:36:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:36:57,180 INFO L225 Difference]: With dead ends: 7629 [2022-02-18 15:36:57,180 INFO L226 Difference]: Without dead ends: 7620 [2022-02-18 15:36:57,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-02-18 15:36:57,181 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1997 mSDsluCounter, 4464 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-18 15:36:57,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1997 Valid, 4794 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3952 Invalid, 0 Unknown, 279 Unchecked, 1.7s Time] [2022-02-18 15:36:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2022-02-18 15:36:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 3152. [2022-02-18 15:36:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3145 states have (on average 1.9774244833068362) internal successors, (6219), 3151 states have internal predecessors, (6219), 0 states have call successors, (0), 0 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-18 15:36:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 6219 transitions. [2022-02-18 15:36:57,238 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 6219 transitions. Word has length 134 [2022-02-18 15:36:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:36:57,238 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 6219 transitions. [2022-02-18 15:36:57,238 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-18 15:36:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 6219 transitions. [2022-02-18 15:36:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:36:57,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:36:57,240 INFO L514 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-18 15:36:57,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-02-18 15:36:57,455 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-18 15:36:57,455 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:36:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:36:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1179672212, now seen corresponding path program 1 times [2022-02-18 15:36:57,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:36:57,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085857609] [2022-02-18 15:36:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:36:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:57,700 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-18 15:36:57,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:36:57,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085857609] [2022-02-18 15:36:57,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085857609] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:36:57,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833567117] [2022-02-18 15:36:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:36:57,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:36:57,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:36:57,702 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-18 15:36:57,702 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-18 15:36:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:36:57,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-18 15:36:57,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:36:58,525 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-18 15:36:58,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,556 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-18 15:36:58,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,592 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-18 15:36:58,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:36:58,638 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-18 15:36:58,716 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-02-18 15:36:58,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-02-18 15:36:58,742 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-18 15:36:58,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:36:59,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:36:59,709 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-18 15:36:59,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833567117] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:36:59,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:36:59,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-18 15:36:59,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142552261] [2022-02-18 15:36:59,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:36:59,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-18 15:36:59,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:36:59,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-18 15:36:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-02-18 15:36:59,710 INFO L87 Difference]: Start difference. First operand 3152 states and 6219 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-18 15:37:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:37:02,933 INFO L93 Difference]: Finished difference Result 7625 states and 15041 transitions. [2022-02-18 15:37:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-18 15:37:02,933 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-18 15:37:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:37:02,944 INFO L225 Difference]: With dead ends: 7625 [2022-02-18 15:37:02,944 INFO L226 Difference]: Without dead ends: 7597 [2022-02-18 15:37:02,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1163, Invalid=5977, Unknown=0, NotChecked=0, Total=7140 [2022-02-18 15:37:02,945 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 2466 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-18 15:37:02,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2466 Valid, 4041 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3229 Invalid, 0 Unknown, 498 Unchecked, 1.5s Time] [2022-02-18 15:37:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2022-02-18 15:37:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 3312. [2022-02-18 15:37:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3305 states have (on average 1.9797276853252648) internal successors, (6543), 3311 states have internal predecessors, (6543), 0 states have call successors, (0), 0 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-18 15:37:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 6543 transitions. [2022-02-18 15:37:03,002 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 6543 transitions. Word has length 134 [2022-02-18 15:37:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:37:03,002 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 6543 transitions. [2022-02-18 15:37:03,002 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-18 15:37:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 6543 transitions. [2022-02-18 15:37:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:37:03,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:37:03,005 INFO L514 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-18 15:37:03,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-02-18 15:37:03,218 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-18 15:37:03,218 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:37:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:37:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash -839246923, now seen corresponding path program 1 times [2022-02-18 15:37:03,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:37:03,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901576966] [2022-02-18 15:37:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:37:03,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:37:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:37:03,657 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-18 15:37:03,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:37:03,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901576966] [2022-02-18 15:37:03,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901576966] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:37:03,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120913003] [2022-02-18 15:37:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:37:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:37:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:37:03,658 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-18 15:37:03,659 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-18 15:37:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:37:03,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-18 15:37:03,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:37:04,585 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-18 15:37:04,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,630 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-18 15:37:04,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,669 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-18 15:37:04,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,727 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-18 15:37:04,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,827 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-18 15:37:04,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,869 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-18 15:37:04,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,894 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-18 15:37:04,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:04,920 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-18 15:37:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:05,055 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-18 15:37:10,746 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-18 15:37:10,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:37:12,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:37:12,960 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-18 15:37:12,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120913003] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:37:12,960 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:37:12,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-02-18 15:37:12,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299128767] [2022-02-18 15:37:12,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:37:12,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-18 15:37:12,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:37:12,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-18 15:37:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1739, Unknown=2, NotChecked=0, Total=1980 [2022-02-18 15:37:12,962 INFO L87 Difference]: Start difference. First operand 3312 states and 6543 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-18 15:37:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:37:47,618 INFO L93 Difference]: Finished difference Result 9029 states and 17852 transitions. [2022-02-18 15:37:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-18 15:37:47,618 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-18 15:37:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:37:47,632 INFO L225 Difference]: With dead ends: 9029 [2022-02-18 15:37:47,632 INFO L226 Difference]: Without dead ends: 9017 [2022-02-18 15:37:47,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=1670, Invalid=8614, Unknown=18, NotChecked=0, Total=10302 [2022-02-18 15:37:47,635 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 2878 mSDsluCounter, 4767 mSDsCounter, 0 mSdLazyCounter, 4140 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2878 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 5818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 4140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1332 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-18 15:37:47,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2878 Valid, 5121 Invalid, 5818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 4140 Invalid, 0 Unknown, 1332 Unchecked, 2.1s Time] [2022-02-18 15:37:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2022-02-18 15:37:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 3517. [2022-02-18 15:37:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3510 states have (on average 1.9814814814814814) internal successors, (6955), 3516 states have internal predecessors, (6955), 0 states have call successors, (0), 0 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-18 15:37:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 6955 transitions. [2022-02-18 15:37:47,711 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 6955 transitions. Word has length 134 [2022-02-18 15:37:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:37:47,711 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 6955 transitions. [2022-02-18 15:37:47,711 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-18 15:37:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 6955 transitions. [2022-02-18 15:37:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:37:47,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:37:47,714 INFO L514 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, 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] [2022-02-18 15:37:47,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-02-18 15:37:47,930 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-18 15:37:47,930 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:37:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:37:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1180858669, now seen corresponding path program 1 times [2022-02-18 15:37:47,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:37:47,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390695315] [2022-02-18 15:37:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:37:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:37:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:37:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-18 15:37:48,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:37:48,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390695315] [2022-02-18 15:37:48,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390695315] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:37:48,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566386758] [2022-02-18 15:37:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:37:48,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:37:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:37:48,093 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-18 15:37:48,093 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-18 15:37:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:37:48,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-18 15:37:48,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:37:48,911 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-18 15:37:48,945 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-02-18 15:37:48,946 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-18 15:37:48,973 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-18 15:37:48,973 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-18 15:37:49,009 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-18 15:37:49,009 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-18 15:37:49,055 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-18 15:37:49,055 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-18 15:37:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-18 15:37:49,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:37:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-18 15:37:49,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566386758] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:37:49,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:37:49,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-02-18 15:37:49,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765611263] [2022-02-18 15:37:49,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:37:49,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-18 15:37:49,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:37:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-18 15:37:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-02-18 15:37:49,517 INFO L87 Difference]: Start difference. First operand 3517 states and 6955 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-18 15:37:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:37:53,902 INFO L93 Difference]: Finished difference Result 7638 states and 15074 transitions. [2022-02-18 15:37:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-18 15:37:53,902 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-18 15:37:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:37:53,910 INFO L225 Difference]: With dead ends: 7638 [2022-02-18 15:37:53,911 INFO L226 Difference]: Without dead ends: 7610 [2022-02-18 15:37:53,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1853, Invalid=9919, Unknown=0, NotChecked=0, Total=11772 [2022-02-18 15:37:53,915 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 2670 mSDsluCounter, 4644 mSDsCounter, 0 mSdLazyCounter, 5177 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 5058 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-18 15:37:53,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2670 Valid, 5058 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5177 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-18 15:37:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-02-18 15:37:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 3445. [2022-02-18 15:37:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3438 states have (on average 1.973240255962769) internal successors, (6784), 3444 states have internal predecessors, (6784), 0 states have call successors, (0), 0 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-18 15:37:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6784 transitions. [2022-02-18 15:37:53,959 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6784 transitions. Word has length 134 [2022-02-18 15:37:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:37:53,959 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 6784 transitions. [2022-02-18 15:37:53,959 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-18 15:37:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6784 transitions. [2022-02-18 15:37:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:37:53,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:37:53,962 INFO L514 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-18 15:37:53,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-02-18 15:37:54,162 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-18 15:37:54,162 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:37:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:37:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1411337857, now seen corresponding path program 3 times [2022-02-18 15:37:54,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:37:54,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893343356] [2022-02-18 15:37:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:37:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:37:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:37:54,388 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-18 15:37:54,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:37:54,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893343356] [2022-02-18 15:37:54,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893343356] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:37:54,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757714646] [2022-02-18 15:37:54,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 15:37:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:37:54,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:37:54,390 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-18 15:37:54,391 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-18 15:37:54,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-18 15:37:54,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:37:54,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-18 15:37:54,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:37:55,371 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-18 15:37:55,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,403 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-18 15:37:55,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,446 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-18 15:37:55,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,500 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-18 15:37:55,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:37:55,649 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-18 15:37:55,691 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-18 15:37:55,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:38:02,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2022-02-18 15:38:03,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-02-18 15:38:04,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) is different from false [2022-02-18 15:38:05,603 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-18 15:38:05,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757714646] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:38:05,603 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:38:05,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-18 15:38:05,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959718277] [2022-02-18 15:38:05,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:38:05,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-18 15:38:05,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:38:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-18 15:38:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1233, Unknown=10, NotChecked=222, Total=1640 [2022-02-18 15:38:05,605 INFO L87 Difference]: Start difference. First operand 3445 states and 6784 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-18 15:38:07,199 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-02-18 15:38:07,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2022-02-18 15:38:08,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-18 15:38:10,594 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-02-18 15:38:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:38:11,654 INFO L93 Difference]: Finished difference Result 12498 states and 24795 transitions. [2022-02-18 15:38:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-18 15:38:11,654 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-18 15:38:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:38:11,668 INFO L225 Difference]: With dead ends: 12498 [2022-02-18 15:38:11,669 INFO L226 Difference]: Without dead ends: 12495 [2022-02-18 15:38:11,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1376, Invalid=6648, Unknown=14, NotChecked=1274, Total=9312 [2022-02-18 15:38:11,670 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 2366 mSDsluCounter, 5276 mSDsCounter, 0 mSdLazyCounter, 3828 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 5667 SdHoareTripleChecker+Invalid, 5807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1840 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-18 15:38:11,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2366 Valid, 5667 Invalid, 5807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3828 Invalid, 0 Unknown, 1840 Unchecked, 1.7s Time] [2022-02-18 15:38:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12495 states. [2022-02-18 15:38:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12495 to 3469. [2022-02-18 15:38:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3462 states have (on average 1.973425765453495) internal successors, (6832), 3468 states have internal predecessors, (6832), 0 states have call successors, (0), 0 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-18 15:38:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 6832 transitions. [2022-02-18 15:38:11,733 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 6832 transitions. Word has length 134 [2022-02-18 15:38:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:38:11,733 INFO L470 AbstractCegarLoop]: Abstraction has 3469 states and 6832 transitions. [2022-02-18 15:38:11,733 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-18 15:38:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 6832 transitions. [2022-02-18 15:38:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:38:11,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:38:11,736 INFO L514 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-18 15:38:11,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-02-18 15:38:11,945 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-18 15:38:11,946 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:38:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:38:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1408959273, now seen corresponding path program 4 times [2022-02-18 15:38:11,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:38:11,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591573352] [2022-02-18 15:38:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:38:11,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:38:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:38:12,174 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-18 15:38:12,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:38:12,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591573352] [2022-02-18 15:38:12,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591573352] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:38:12,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119259163] [2022-02-18 15:38:12,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 15:38:12,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:38:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:38:12,175 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 15:38:12,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-02-18 15:38:12,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 15:38:12,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:38:12,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-02-18 15:38:12,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:38:13,192 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-18 15:38:13,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,223 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-18 15:38:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,259 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-18 15:38:13,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,337 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-18 15:38:13,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:13,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 15:38:13,430 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 6 case distinctions, treesize of input 50 treesize of output 58 [2022-02-18 15:38:13,458 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-18 15:38:13,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:38:14,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) is different from false [2022-02-18 15:38:15,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-02-18 15:38:16,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (and (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)))) is different from false [2022-02-18 15:38:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-18 15:38:16,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119259163] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:38:16,759 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:38:16,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2022-02-18 15:38:16,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887080381] [2022-02-18 15:38:16,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:38:16,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-18 15:38:16,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:38:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-18 15:38:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1317, Unknown=3, NotChecked=228, Total=1722 [2022-02-18 15:38:16,760 INFO L87 Difference]: Start difference. First operand 3469 states and 6832 transitions. Second operand has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 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-18 15:38:25,116 WARN L228 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 75 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-18 15:38:25,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (< (div (+ (* (- 28) |c_ULTIMATE.start_main_~i~2#1|) (- 4)) (- 28)) .cse0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|)) (< (div (+ (- 4) |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) .cse0)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-18 15:38:28,502 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (< (div (+ (* (- 28) |c_ULTIMATE.start_main_~i~2#1|) (- 4)) (- 28)) .cse0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (or (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|)) (< (div (+ (- 4) |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) .cse0)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-18 15:38:29,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-18 15:38:30,054 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-02-18 15:38:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:38:31,039 INFO L93 Difference]: Finished difference Result 14256 states and 28293 transitions. [2022-02-18 15:38:31,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-02-18 15:38:31,040 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 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-18 15:38:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:38:31,056 INFO L225 Difference]: With dead ends: 14256 [2022-02-18 15:38:31,056 INFO L226 Difference]: Without dead ends: 14253 [2022-02-18 15:38:31,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 242 SyntacticMatches, 8 SemanticMatches, 116 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4598 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1716, Invalid=10515, Unknown=7, NotChecked=1568, Total=13806 [2022-02-18 15:38:31,057 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 2421 mSDsluCounter, 6985 mSDsCounter, 0 mSdLazyCounter, 5684 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 7395 SdHoareTripleChecker+Invalid, 9740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3921 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-18 15:38:31,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2421 Valid, 7395 Invalid, 9740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 5684 Invalid, 0 Unknown, 3921 Unchecked, 2.5s Time] [2022-02-18 15:38:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2022-02-18 15:38:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 3476. [2022-02-18 15:38:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3469 states have (on average 1.973479388872874) internal successors, (6846), 3475 states have internal predecessors, (6846), 0 states have call successors, (0), 0 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-18 15:38:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 6846 transitions. [2022-02-18 15:38:31,130 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 6846 transitions. Word has length 134 [2022-02-18 15:38:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:38:31,130 INFO L470 AbstractCegarLoop]: Abstraction has 3476 states and 6846 transitions. [2022-02-18 15:38:31,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 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-18 15:38:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 6846 transitions. [2022-02-18 15:38:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:38:31,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:38:31,133 INFO L514 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-18 15:38:31,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-02-18 15:38:31,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-02-18 15:38:31,334 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:38:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:38:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2011124973, now seen corresponding path program 5 times [2022-02-18 15:38:31,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:38:31,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864679864] [2022-02-18 15:38:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:38:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:38:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:38:31,528 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-18 15:38:31,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:38:31,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864679864] [2022-02-18 15:38:31,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864679864] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:38:31,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368585307] [2022-02-18 15:38:31,531 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-18 15:38:31,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:38:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:38:31,532 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 15:38:31,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-02-18 15:38:31,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-02-18 15:38:31,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:38:31,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-18 15:38:31,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:38:32,479 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-18 15:38:32,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:32,526 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-18 15:38:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:32,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:32,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:38:32,563 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-18 15:38:32,692 INFO L353 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2022-02-18 15:38:32,692 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-18 15:38:32,737 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-18 15:38:32,738 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-18 15:38:32,764 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-18 15:38:32,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:38:58,308 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-18 15:38:58,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368585307] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:38:58,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:38:58,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-02-18 15:38:58,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832748057] [2022-02-18 15:38:58,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:38:58,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-18 15:38:58,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:38:58,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-18 15:38:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1364, Unknown=24, NotChecked=0, Total=1560 [2022-02-18 15:38:58,309 INFO L87 Difference]: Start difference. First operand 3476 states and 6846 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-18 15:39:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:39:01,596 INFO L93 Difference]: Finished difference Result 7579 states and 14963 transitions. [2022-02-18 15:39:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-18 15:39:01,596 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-18 15:39:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:39:01,604 INFO L225 Difference]: With dead ends: 7579 [2022-02-18 15:39:01,604 INFO L226 Difference]: Without dead ends: 7579 [2022-02-18 15:39:01,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=908, Invalid=4468, Unknown=26, NotChecked=0, Total=5402 [2022-02-18 15:39:01,605 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1861 mSDsluCounter, 4007 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 4342 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-18 15:39:01,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1861 Valid, 4342 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1828 Invalid, 0 Unknown, 587 Unchecked, 0.9s Time] [2022-02-18 15:39:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2022-02-18 15:39:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 3532. [2022-02-18 15:39:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 3525 states have (on average 1.9739007092198582) internal successors, (6958), 3531 states have internal predecessors, (6958), 0 states have call successors, (0), 0 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-18 15:39:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 6958 transitions. [2022-02-18 15:39:01,650 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 6958 transitions. Word has length 134 [2022-02-18 15:39:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:39:01,650 INFO L470 AbstractCegarLoop]: Abstraction has 3532 states and 6958 transitions. [2022-02-18 15:39:01,650 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-18 15:39:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 6958 transitions. [2022-02-18 15:39:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:39:01,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:39:01,653 INFO L514 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-18 15:39:01,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-02-18 15:39:01,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-02-18 15:39:01,855 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:39:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:39:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -467560269, now seen corresponding path program 6 times [2022-02-18 15:39:01,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:39:01,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561284164] [2022-02-18 15:39:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:39:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:39:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:39:02,083 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-18 15:39:02,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:39:02,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561284164] [2022-02-18 15:39:02,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561284164] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:39:02,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051156351] [2022-02-18 15:39:02,084 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-18 15:39:02,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:39:02,085 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 15:39:02,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-02-18 15:39:02,444 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-18 15:39:02,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:39:02,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-18 15:39:02,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:39:03,138 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-18 15:39:03,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,176 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-18 15:39:03,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,254 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-18 15:39:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,303 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-18 15:39:03,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:03,406 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-18 15:39:03,460 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-18 15:39:03,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:39:04,328 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) is different from false [2022-02-18 15:39:05,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) is different from false [2022-02-18 15:39:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-18 15:39:05,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051156351] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:39:05,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:39:05,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-18 15:39:05,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548059375] [2022-02-18 15:39:05,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:39:05,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-18 15:39:05,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:39:05,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-18 15:39:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1324, Unknown=2, NotChecked=150, Total=1640 [2022-02-18 15:39:05,470 INFO L87 Difference]: Start difference. First operand 3532 states and 6958 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-18 15:39:07,181 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-02-18 15:39:07,754 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2022-02-18 15:39:11,090 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-02-18 15:39:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:39:12,822 INFO L93 Difference]: Finished difference Result 12664 states and 25126 transitions. [2022-02-18 15:39:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-18 15:39:12,822 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-18 15:39:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:39:12,836 INFO L225 Difference]: With dead ends: 12664 [2022-02-18 15:39:12,837 INFO L226 Difference]: Without dead ends: 12655 [2022-02-18 15:39:12,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4597 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2114, Invalid=12421, Unknown=5, NotChecked=1210, Total=15750 [2022-02-18 15:39:12,837 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 2149 mSDsluCounter, 6511 mSDsCounter, 0 mSdLazyCounter, 5746 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 6955 SdHoareTripleChecker+Invalid, 8025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 5746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2124 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-18 15:39:12,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2149 Valid, 6955 Invalid, 8025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 5746 Invalid, 0 Unknown, 2124 Unchecked, 2.8s Time] [2022-02-18 15:39:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2022-02-18 15:39:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 3590. [2022-02-18 15:39:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3583 states have (on average 1.9743231928551492) internal successors, (7074), 3589 states have internal predecessors, (7074), 0 states have call successors, (0), 0 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-18 15:39:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 7074 transitions. [2022-02-18 15:39:12,904 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 7074 transitions. Word has length 134 [2022-02-18 15:39:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:39:12,904 INFO L470 AbstractCegarLoop]: Abstraction has 3590 states and 7074 transitions. [2022-02-18 15:39:12,904 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-18 15:39:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 7074 transitions. [2022-02-18 15:39:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:39:12,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:39:12,907 INFO L514 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-18 15:39:12,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-02-18 15:39:13,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:13,123 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:39:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:39:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 416790693, now seen corresponding path program 7 times [2022-02-18 15:39:13,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:39:13,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932540076] [2022-02-18 15:39:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:39:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:39:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:39:13,344 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-18 15:39:13,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:39:13,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932540076] [2022-02-18 15:39:13,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932540076] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:39:13,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057449657] [2022-02-18 15:39:13,345 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 15:39:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:13,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:39:13,346 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 15:39:13,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-02-18 15:39:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:39:13,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-18 15:39:13,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:39:14,321 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-18 15:39:14,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,398 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-18 15:39:14,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,439 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-18 15:39:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,484 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-18 15:39:14,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:14,585 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-18 15:39:14,614 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-18 15:39:14,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:39:16,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| Int)) (or (and (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82|)))) is different from false [2022-02-18 15:39:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-02-18 15:39:16,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057449657] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:39:16,757 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:39:16,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-02-18 15:39:16,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759616430] [2022-02-18 15:39:16,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:39:16,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-18 15:39:16,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:39:16,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-18 15:39:16,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1385, Unknown=1, NotChecked=76, Total=1640 [2022-02-18 15:39:16,758 INFO L87 Difference]: Start difference. First operand 3590 states and 7074 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-18 15:39:18,176 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| Int)) (or (and (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82|)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-02-18 15:39:20,392 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| Int)) (or (and (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6115 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82| v_ArrVal_6115))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_82|)))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-02-18 15:39:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:39:22,544 INFO L93 Difference]: Finished difference Result 12121 states and 24032 transitions. [2022-02-18 15:39:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-18 15:39:22,545 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-18 15:39:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:39:22,557 INFO L225 Difference]: With dead ends: 12121 [2022-02-18 15:39:22,557 INFO L226 Difference]: Without dead ends: 12097 [2022-02-18 15:39:22,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1830, Invalid=9309, Unknown=3, NotChecked=630, Total=11772 [2022-02-18 15:39:22,558 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 2565 mSDsluCounter, 4610 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2565 SdHoareTripleChecker+Valid, 4986 SdHoareTripleChecker+Invalid, 5522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1281 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-18 15:39:22,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2565 Valid, 4986 Invalid, 5522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 4030 Invalid, 0 Unknown, 1281 Unchecked, 1.8s Time] [2022-02-18 15:39:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12097 states. [2022-02-18 15:39:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12097 to 3665. [2022-02-18 15:39:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 3658 states have (on average 1.9748496446145434) internal successors, (7224), 3664 states have internal predecessors, (7224), 0 states have call successors, (0), 0 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-18 15:39:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 7224 transitions. [2022-02-18 15:39:22,623 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 7224 transitions. Word has length 134 [2022-02-18 15:39:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:39:22,623 INFO L470 AbstractCegarLoop]: Abstraction has 3665 states and 7224 transitions. [2022-02-18 15:39:22,623 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-18 15:39:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 7224 transitions. [2022-02-18 15:39:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:39:22,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:39:22,625 INFO L514 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-18 15:39:22,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-02-18 15:39:22,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:22,826 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:39:22,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:39:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1443949989, now seen corresponding path program 8 times [2022-02-18 15:39:22,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:39:22,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588641442] [2022-02-18 15:39:22,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:39:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:39:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:39:23,006 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-18 15:39:23,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:39:23,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588641442] [2022-02-18 15:39:23,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588641442] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:39:23,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195484023] [2022-02-18 15:39:23,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:39:23,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:39:23,008 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 15:39:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-02-18 15:39:23,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 15:39:23,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:39:23,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-18 15:39:23,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:39:23,783 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-18 15:39:23,889 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-18 15:39:23,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:23,965 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-18 15:39:24,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:24,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-18 15:39:24,088 INFO L353 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2022-02-18 15:39:24,088 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 33 treesize of output 35 [2022-02-18 15:39:24,134 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-18 15:39:24,134 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-18 15:39:24,181 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-18 15:39:24,182 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-18 15:39:24,212 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-18 15:39:24,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:39:24,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:24,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:24,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 15:39:24,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-02-18 15:39:24,960 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-18 15:39:24,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195484023] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 15:39:24,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 15:39:24,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 42 [2022-02-18 15:39:24,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889884497] [2022-02-18 15:39:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 15:39:24,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-18 15:39:24,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 15:39:24,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-18 15:39:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2022-02-18 15:39:24,962 INFO L87 Difference]: Start difference. First operand 3665 states and 7224 transitions. Second operand has 43 states, 42 states have (on average 5.571428571428571) internal successors, (234), 43 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-18 15:39:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 15:39:30,110 INFO L93 Difference]: Finished difference Result 9491 states and 18782 transitions. [2022-02-18 15:39:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-18 15:39:30,111 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 5.571428571428571) internal successors, (234), 43 states have internal predecessors, (234), 0 states have call successors, (0), 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-18 15:39:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 15:39:30,120 INFO L225 Difference]: With dead ends: 9491 [2022-02-18 15:39:30,120 INFO L226 Difference]: Without dead ends: 9470 [2022-02-18 15:39:30,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2229, Invalid=9113, Unknown=0, NotChecked=0, Total=11342 [2022-02-18 15:39:30,121 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 2663 mSDsluCounter, 5360 mSDsCounter, 0 mSdLazyCounter, 4548 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 5774 SdHoareTripleChecker+Invalid, 5936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 4548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1065 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-18 15:39:30,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2663 Valid, 5774 Invalid, 5936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 4548 Invalid, 0 Unknown, 1065 Unchecked, 2.3s Time] [2022-02-18 15:39:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9470 states. [2022-02-18 15:39:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9470 to 3705. [2022-02-18 15:39:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 3698 states have (on average 1.9751216873985937) internal successors, (7304), 3704 states have internal predecessors, (7304), 0 states have call successors, (0), 0 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-18 15:39:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 7304 transitions. [2022-02-18 15:39:30,171 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 7304 transitions. Word has length 134 [2022-02-18 15:39:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 15:39:30,171 INFO L470 AbstractCegarLoop]: Abstraction has 3705 states and 7304 transitions. [2022-02-18 15:39:30,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 5.571428571428571) internal successors, (234), 43 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-18 15:39:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 7304 transitions. [2022-02-18 15:39:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-18 15:39:30,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 15:39:30,173 INFO L514 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-18 15:39:30,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-02-18 15:39:30,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:30,374 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-18 15:39:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 15:39:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1462386007, now seen corresponding path program 2 times [2022-02-18 15:39:30,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 15:39:30,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699031859] [2022-02-18 15:39:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 15:39:30,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 15:39:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 15:39:30,700 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-18 15:39:30,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 15:39:30,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699031859] [2022-02-18 15:39:30,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699031859] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 15:39:30,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110414905] [2022-02-18 15:39:30,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 15:39:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 15:39:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 15:39:30,701 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 15:39:30,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-02-18 15:39:31,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 15:39:31,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 15:39:31,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-18 15:39:31,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 15:39:31,670 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-18 15:39:31,729 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-18 15:39:31,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,767 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-18 15:39:31,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,812 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-18 15:39:31,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,861 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-18 15:39:31,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:31,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-18 15:39:32,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,054 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-18 15:39:32,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,079 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-18 15:39:32,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,105 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-18 15:39:32,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,130 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-18 15:39:32,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 15:39:32,276 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 74 treesize of output 88 [2022-02-18 15:39:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-18 15:39:42,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 15:39:50,122 INFO L353 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-02-18 15:39:50,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 30732 treesize of output 30747 [2022-02-18 15:39:51,177 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-18 15:39:51,178 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 20187 treesize of output 20181 [2022-02-18 15:39:51,262 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-18 15:39:51,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-02-18 15:39:51,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-02-18 15:39:51,476 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:113) 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:610) 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:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-18 15:39:51,479 INFO L158 Benchmark]: Toolchain (without parser) took 261636.36ms. Allocated memory was 184.5MB in the beginning and 480.2MB in the end (delta: 295.7MB). Free memory was 131.5MB in the beginning and 241.3MB in the end (delta: -109.8MB). Peak memory consumption was 266.3MB. Max. memory is 8.0GB. [2022-02-18 15:39:51,479 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 184.5MB. Free memory was 149.6MB in the beginning and 149.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-18 15:39:51,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.08ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 142.4MB in the end (delta: -11.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-02-18 15:39:51,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 184.5MB. Free memory was 142.4MB in the beginning and 139.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-18 15:39:51,479 INFO L158 Benchmark]: Boogie Preprocessor took 37.13ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 137.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-18 15:39:51,479 INFO L158 Benchmark]: RCFGBuilder took 311.84ms. Allocated memory is still 184.5MB. Free memory was 137.8MB in the beginning and 123.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-18 15:39:51,479 INFO L158 Benchmark]: TraceAbstraction took 260778.96ms. Allocated memory was 184.5MB in the beginning and 480.2MB in the end (delta: 295.7MB). Free memory was 123.1MB in the beginning and 241.3MB in the end (delta: -118.2MB). Peak memory consumption was 259.2MB. Max. memory is 8.0GB. [2022-02-18 15:39:51,480 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.40ms. Allocated memory is still 184.5MB. Free memory was 149.6MB in the beginning and 149.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 446.08ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 142.4MB in the end (delta: -11.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 184.5MB. Free memory was 142.4MB in the beginning and 139.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.13ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 137.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 311.84ms. Allocated memory is still 184.5MB. Free memory was 137.8MB in the beginning and 123.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 260778.96ms. Allocated memory was 184.5MB in the beginning and 480.2MB in the end (delta: 295.7MB). Free memory was 123.1MB in the beginning and 241.3MB in the end (delta: -118.2MB). Peak memory consumption was 259.2MB. 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:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-18 15:39:51,645 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...