/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_04-funloop_hard1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:49:08,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:49:08,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:49:08,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:49:08,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:49:08,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:49:08,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:49:08,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:49:08,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:49:08,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:49:08,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:49:08,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:49:08,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:49:08,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:49:08,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:49:08,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:49:08,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:49:08,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:49:08,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:49:08,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:49:08,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:49:08,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:49:08,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:49:08,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:49:08,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:49:08,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:49:08,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:49:08,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:49:08,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:49:08,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:49:08,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:49:08,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:49:08,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:49:08,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:49:08,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:49:08,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:49:08,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:49:08,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:49:08,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:49:08,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:49:08,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:49:08,557 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-03-01 16:49:08,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:49:08,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:49:08,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:49:08,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:49:08,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:49:08,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:49:08,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:49:08,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:49:08,573 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:49:08,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:49:08,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:49:08,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:49:08,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:49:08,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:49:08,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:49:08,576 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-03-01 16:49:08,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:49:08,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:49:08,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:49:08,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:49:08,802 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:49:08,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-03-01 16:49:08,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a70d41/48a16d8db06045669ec4fdee6af50580/FLAG6e3cd8a93 [2022-03-01 16:49:09,292 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:49:09,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-03-01 16:49:09,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a70d41/48a16d8db06045669ec4fdee6af50580/FLAG6e3cd8a93 [2022-03-01 16:49:09,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a70d41/48a16d8db06045669ec4fdee6af50580 [2022-03-01 16:49:09,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:49:09,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:49:09,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:49:09,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:49:09,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:49:09,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5dea93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09, skipping insertion in model container [2022-03-01 16:49:09,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:49:09,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:49:09,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:49:09,692 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:49:09,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:49:09,782 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:49:09,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09 WrapperNode [2022-03-01 16:49:09,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:49:09,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:49:09,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:49:09,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:49:09,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,841 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2022-03-01 16:49:09,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:49:09,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:49:09,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:49:09,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:49:09,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:49:09,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:49:09,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:49:09,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:49:09,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (1/1) ... [2022-03-01 16:49:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:49:09,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:09,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 16:49:09,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:49:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-01 16:49:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-01 16:49:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:49:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:49:09,941 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:49:10,042 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:49:10,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:49:10,297 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:49:10,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:49:10,303 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:49:10,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:49:10 BoogieIcfgContainer [2022-03-01 16:49:10,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:49:10,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:49:10,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:49:10,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:49:10,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:49:09" (1/3) ... [2022-03-01 16:49:10,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6247afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:49:10, skipping insertion in model container [2022-03-01 16:49:10,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:49:09" (2/3) ... [2022-03-01 16:49:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6247afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:49:10, skipping insertion in model container [2022-03-01 16:49:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:49:10" (3/3) ... [2022-03-01 16:49:10,310 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2022-03-01 16:49:10,313 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:49:10,313 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:49:10,313 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-01 16:49:10,313 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:49:10,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,345 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-03-01 16:49:10,345 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-03-01 16:49:10,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,346 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-03-01 16:49:10,346 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-03-01 16:49:10,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,347 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-03-01 16:49:10,347 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-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,348 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-03-01 16:49:10,348 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-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,373 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,373 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,373 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,373 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,373 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,373 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,374 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,377 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,380 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-03-01 16:49:10,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,380 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-03-01 16:49:10,380 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,381 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:49:10,383 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 16:49:10,424 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:49:10,429 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-03-01 16:49:10,429 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-01 16:49:10,441 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 128 transitions, 261 flow [2022-03-01 16:49:10,519 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 16:49:10,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:10,535 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] [2022-03-01 16:49:10,535 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash -88358338, now seen corresponding path program 1 times [2022-03-01 16:49:10,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:10,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108583521] [2022-03-01 16:49:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:10,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:10,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108583521] [2022-03-01 16:49:10,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108583521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:10,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:10,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:49:10,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288741748] [2022-03-01 16:49:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:10,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 16:49:10,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 16:49:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 16:49:10,745 INFO L87 Difference]: Start difference. First operand has 2321 states, 2307 states have (on average 2.0416124837451237) internal successors, (4710), 2320 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:10,799 INFO L93 Difference]: Finished difference Result 2321 states and 4620 transitions. [2022-03-01 16:49:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 16:49:10,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-01 16:49:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:10,830 INFO L225 Difference]: With dead ends: 2321 [2022-03-01 16:49:10,831 INFO L226 Difference]: Without dead ends: 2321 [2022-03-01 16:49:10,832 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-03-01 16:49:10,834 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:10,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2022-03-01 16:49:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2022-03-01 16:49:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2307 states have (on average 2.0026007802340704) internal successors, (4620), 2320 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4620 transitions. [2022-03-01 16:49:10,924 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4620 transitions. Word has length 31 [2022-03-01 16:49:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:10,924 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 4620 transitions. [2022-03-01 16:49:10,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4620 transitions. [2022-03-01 16:49:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 16:49:10,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:10,926 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] [2022-03-01 16:49:10,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:49:10,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -932830209, now seen corresponding path program 1 times [2022-03-01 16:49:10,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:10,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890849928] [2022-03-01 16:49:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:10,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:10,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890849928] [2022-03-01 16:49:10,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890849928] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:10,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:10,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:49:10,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903167726] [2022-03-01 16:49:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:10,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:49:10,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:49:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:49:10,985 INFO L87 Difference]: Start difference. First operand 2321 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:11,012 INFO L93 Difference]: Finished difference Result 2325 states and 4624 transitions. [2022-03-01 16:49:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:49:11,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-01 16:49:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:11,021 INFO L225 Difference]: With dead ends: 2325 [2022-03-01 16:49:11,021 INFO L226 Difference]: Without dead ends: 2325 [2022-03-01 16:49:11,022 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-03-01 16:49:11,022 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:11,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-03-01 16:49:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2322. [2022-03-01 16:49:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2308 states have (on average 2.002166377816291) internal successors, (4621), 2321 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4621 transitions. [2022-03-01 16:49:11,103 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 4621 transitions. Word has length 31 [2022-03-01 16:49:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:11,104 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 4621 transitions. [2022-03-01 16:49:11,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 4621 transitions. [2022-03-01 16:49:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-01 16:49:11,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:11,108 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] [2022-03-01 16:49:11,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:49:11,108 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 527090186, now seen corresponding path program 1 times [2022-03-01 16:49:11,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:11,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660073077] [2022-03-01 16:49:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:11,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:11,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660073077] [2022-03-01 16:49:11,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660073077] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:11,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237429800] [2022-03-01 16:49:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:11,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:11,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 16:49:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-01 16:49:11,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:49:11,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:11,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237429800] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:11,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:11,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-01 16:49:11,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486308806] [2022-03-01 16:49:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:11,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:49:11,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:49:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:11,386 INFO L87 Difference]: Start difference. First operand 2322 states and 4621 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:11,431 INFO L93 Difference]: Finished difference Result 3432 states and 6841 transitions. [2022-03-01 16:49:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:49:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-01 16:49:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:11,443 INFO L225 Difference]: With dead ends: 3432 [2022-03-01 16:49:11,444 INFO L226 Difference]: Without dead ends: 3432 [2022-03-01 16:49:11,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:11,446 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 66 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:11,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2022-03-01 16:49:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2359. [2022-03-01 16:49:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2345 states have (on average 2.002132196162047) internal successors, (4695), 2358 states have internal predecessors, (4695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4695 transitions. [2022-03-01 16:49:11,499 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4695 transitions. Word has length 36 [2022-03-01 16:49:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:11,499 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 4695 transitions. [2022-03-01 16:49:11,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4695 transitions. [2022-03-01 16:49:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-01 16:49:11,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:11,502 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-03-01 16:49:11,523 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-03-01 16:49:11,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,721 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:11,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -877434549, now seen corresponding path program 1 times [2022-03-01 16:49:11,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:11,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668692942] [2022-03-01 16:49:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:11,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:11,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668692942] [2022-03-01 16:49:11,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668692942] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:11,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094362004] [2022-03-01 16:49:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:11,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:11,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:11,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:11,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 16:49:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:11,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:49:11,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:11,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:12,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094362004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:12,003 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:12,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:49:12,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287441343] [2022-03-01 16:49:12,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:12,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:12,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:12,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:49:12,005 INFO L87 Difference]: Start difference. First operand 2359 states and 4695 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:12,072 INFO L93 Difference]: Finished difference Result 2369 states and 4705 transitions. [2022-03-01 16:49:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:49:12,073 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-03-01 16:49:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:12,080 INFO L225 Difference]: With dead ends: 2369 [2022-03-01 16:49:12,080 INFO L226 Difference]: Without dead ends: 2369 [2022-03-01 16:49:12,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-01 16:49:12,081 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 16 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:12,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 704 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-03-01 16:49:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2022-03-01 16:49:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2355 states have (on average 1.9978768577494692) internal successors, (4705), 2368 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4705 transitions. [2022-03-01 16:49:12,150 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4705 transitions. Word has length 40 [2022-03-01 16:49:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:12,151 INFO L470 AbstractCegarLoop]: Abstraction has 2369 states and 4705 transitions. [2022-03-01 16:49:12,151 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-03-01 16:49:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4705 transitions. [2022-03-01 16:49:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:49:12,152 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:12,152 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-03-01 16:49:12,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:12,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-01 16:49:12,368 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash -198306197, now seen corresponding path program 2 times [2022-03-01 16:49:12,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:12,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318369755] [2022-03-01 16:49:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:12,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:12,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318369755] [2022-03-01 16:49:12,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318369755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:12,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197272975] [2022-03-01 16:49:12,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:12,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:12,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:12,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 16:49:12,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:12,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:12,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-01 16:49:12,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:12,629 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-03-01 16:49:12,652 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-01 16:49:12,652 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-03-01 16:49:12,709 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-01 16:49:12,709 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-03-01 16:49:12,770 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 16:49:12,770 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-03-01 16:49:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-01 16:49:12,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:12,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197272975] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:12,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:12,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-01 16:49:12,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232372896] [2022-03-01 16:49:12,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:12,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:12,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:12,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-01 16:49:12,791 INFO L87 Difference]: Start difference. First operand 2369 states and 4705 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:12,950 INFO L93 Difference]: Finished difference Result 2638 states and 5243 transitions. [2022-03-01 16:49:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:12,951 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-03-01 16:49:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:12,961 INFO L225 Difference]: With dead ends: 2638 [2022-03-01 16:49:12,961 INFO L226 Difference]: Without dead ends: 2638 [2022-03-01 16:49:12,962 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-03-01 16:49:12,962 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:12,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 479 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:49:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-03-01 16:49:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2502. [2022-03-01 16:49:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2488 states have (on average 1.9979903536977492) internal successors, (4971), 2501 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4971 transitions. [2022-03-01 16:49:13,019 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4971 transitions. Word has length 50 [2022-03-01 16:49:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:13,019 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 4971 transitions. [2022-03-01 16:49:13,020 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-03-01 16:49:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4971 transitions. [2022-03-01 16:49:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-01 16:49:13,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:13,021 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-03-01 16:49:13,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:13,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:13,236 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash 697598481, now seen corresponding path program 1 times [2022-03-01 16:49:13,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:13,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481440142] [2022-03-01 16:49:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:13,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:13,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481440142] [2022-03-01 16:49:13,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481440142] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:13,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888745546] [2022-03-01 16:49:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:13,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:13,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:13,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:13,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 16:49:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:13,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 16:49:13,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:13,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:13,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888745546] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:13,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:13,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-01 16:49:13,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126689838] [2022-03-01 16:49:13,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:13,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 16:49:13,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 16:49:13,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:13,611 INFO L87 Difference]: Start difference. First operand 2502 states and 4971 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:13,753 INFO L93 Difference]: Finished difference Result 2522 states and 4991 transitions. [2022-03-01 16:49:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:49:13,756 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-03-01 16:49:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:13,767 INFO L225 Difference]: With dead ends: 2522 [2022-03-01 16:49:13,767 INFO L226 Difference]: Without dead ends: 2522 [2022-03-01 16:49:13,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-01 16:49:13,769 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 36 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:13,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 938 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:49:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-03-01 16:49:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2022-03-01 16:49:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2508 states have (on average 1.9900318979266347) internal successors, (4991), 2521 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4991 transitions. [2022-03-01 16:49:13,835 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4991 transitions. Word has length 50 [2022-03-01 16:49:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:13,836 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4991 transitions. [2022-03-01 16:49:13,836 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-03-01 16:49:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4991 transitions. [2022-03-01 16:49:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-01 16:49:13,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:13,838 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-03-01 16:49:13,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-01 16:49:14,079 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-03-01 16:49:14,079 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1015929775, now seen corresponding path program 2 times [2022-03-01 16:49:14,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:14,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40856337] [2022-03-01 16:49:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:14,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:14,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40856337] [2022-03-01 16:49:14,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40856337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:14,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670050779] [2022-03-01 16:49:14,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:14,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:14,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:14,224 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:14,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 16:49:14,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:14,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:14,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-01 16:49:14,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:14,443 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-03-01 16:49:14,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,469 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-03-01 16:49:14,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,500 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:14,501 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-03-01 16:49:14,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:49:14,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:49:14,538 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-03-01 16:49:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-01 16:49:14,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:14,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670050779] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:14,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:14,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-01 16:49:14,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990562197] [2022-03-01 16:49:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:14,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:14,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:49:14,564 INFO L87 Difference]: Start difference. First operand 2522 states and 4991 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:15,090 INFO L93 Difference]: Finished difference Result 5451 states and 10849 transitions. [2022-03-01 16:49:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:15,091 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-03-01 16:49:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:15,112 INFO L225 Difference]: With dead ends: 5451 [2022-03-01 16:49:15,113 INFO L226 Difference]: Without dead ends: 5451 [2022-03-01 16:49:15,113 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-03-01 16:49:15,126 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 787 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:15,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 1022 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2022-03-01 16:49:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 3341. [2022-03-01 16:49:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3327 states have (on average 1.9924857228734596) internal successors, (6629), 3340 states have internal predecessors, (6629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 6629 transitions. [2022-03-01 16:49:15,208 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 6629 transitions. Word has length 70 [2022-03-01 16:49:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:15,208 INFO L470 AbstractCegarLoop]: Abstraction has 3341 states and 6629 transitions. [2022-03-01 16:49:15,209 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-03-01 16:49:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 6629 transitions. [2022-03-01 16:49:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-01 16:49:15,209 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:15,210 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-03-01 16:49:15,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:15,427 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-03-01 16:49:15,428 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -177478757, now seen corresponding path program 1 times [2022-03-01 16:49:15,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:15,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399561031] [2022-03-01 16:49:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:15,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:15,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399561031] [2022-03-01 16:49:15,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399561031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:15,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591603441] [2022-03-01 16:49:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:15,577 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:15,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 16:49:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:15,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 16:49:15,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:15,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:49:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:49:15,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591603441] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:49:15,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:49:15,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-01 16:49:15,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220404847] [2022-03-01 16:49:15,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:49:15,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:49:15,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:15,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:49:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:15,963 INFO L87 Difference]: Start difference. First operand 3341 states and 6629 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:16,207 INFO L93 Difference]: Finished difference Result 3356 states and 6644 transitions. [2022-03-01 16:49:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:49:16,207 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-03-01 16:49:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:16,215 INFO L225 Difference]: With dead ends: 3356 [2022-03-01 16:49:16,215 INFO L226 Difference]: Without dead ends: 3356 [2022-03-01 16:49:16,216 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-03-01 16:49:16,217 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 40 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:16,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 1058 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:49:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2022-03-01 16:49:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3356. [2022-03-01 16:49:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3342 states have (on average 1.988031119090365) internal successors, (6644), 3355 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 6644 transitions. [2022-03-01 16:49:16,282 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 6644 transitions. Word has length 78 [2022-03-01 16:49:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:16,283 INFO L470 AbstractCegarLoop]: Abstraction has 3356 states and 6644 transitions. [2022-03-01 16:49:16,283 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-03-01 16:49:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 6644 transitions. [2022-03-01 16:49:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 16:49:16,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:16,284 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-03-01 16:49:16,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:16,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:16,503 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 26007824, now seen corresponding path program 2 times [2022-03-01 16:49:16,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:16,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957887002] [2022-03-01 16:49:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:16,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:16,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957887002] [2022-03-01 16:49:16,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957887002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:16,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:16,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:49:16,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6045789] [2022-03-01 16:49:16,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:16,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:16,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:16,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:16,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:16,580 INFO L87 Difference]: Start difference. First operand 3356 states and 6644 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:16,687 INFO L93 Difference]: Finished difference Result 3594 states and 7120 transitions. [2022-03-01 16:49:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:16,687 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-03-01 16:49:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:16,693 INFO L225 Difference]: With dead ends: 3594 [2022-03-01 16:49:16,693 INFO L226 Difference]: Without dead ends: 3594 [2022-03-01 16:49:16,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:16,694 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:16,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 398 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:49:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-03-01 16:49:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3480. [2022-03-01 16:49:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3466 states have (on average 1.988459319099827) internal successors, (6892), 3479 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 6892 transitions. [2022-03-01 16:49:16,758 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 6892 transitions. Word has length 93 [2022-03-01 16:49:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:16,758 INFO L470 AbstractCegarLoop]: Abstraction has 3480 states and 6892 transitions. [2022-03-01 16:49:16,758 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-03-01 16:49:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 6892 transitions. [2022-03-01 16:49:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 16:49:16,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:16,759 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-03-01 16:49:16,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 16:49:16,759 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash 360970443, now seen corresponding path program 1 times [2022-03-01 16:49:16,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:16,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128162409] [2022-03-01 16:49:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:16,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:16,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128162409] [2022-03-01 16:49:16,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128162409] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:16,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:49:16,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:49:16,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671256470] [2022-03-01 16:49:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:16,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:49:16,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:49:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:16,825 INFO L87 Difference]: Start difference. First operand 3480 states and 6892 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:17,040 INFO L93 Difference]: Finished difference Result 3912 states and 7756 transitions. [2022-03-01 16:49:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:49:17,041 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-03-01 16:49:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:17,047 INFO L225 Difference]: With dead ends: 3912 [2022-03-01 16:49:17,047 INFO L226 Difference]: Without dead ends: 3912 [2022-03-01 16:49:17,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:49:17,048 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 194 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:17,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 588 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:49:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2022-03-01 16:49:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3714. [2022-03-01 16:49:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3700 states have (on average 1.9891891891891893) internal successors, (7360), 3713 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7360 transitions. [2022-03-01 16:49:17,099 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7360 transitions. Word has length 93 [2022-03-01 16:49:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:17,099 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 7360 transitions. [2022-03-01 16:49:17,099 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-03-01 16:49:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7360 transitions. [2022-03-01 16:49:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:17,100 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:17,100 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-03-01 16:49:17,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:49:17,101 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1199640953, now seen corresponding path program 1 times [2022-03-01 16:49:17,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:17,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141697519] [2022-03-01 16:49:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:17,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:17,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141697519] [2022-03-01 16:49:17,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141697519] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:17,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091484821] [2022-03-01 16:49:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:17,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:17,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:17,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 16:49:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:17,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:17,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:17,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:49:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:17,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:17,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091484821] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:17,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:17,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-01 16:49:17,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386850162] [2022-03-01 16:49:17,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:17,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:17,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:49:17,908 INFO L87 Difference]: Start difference. First operand 3714 states and 7360 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:18,366 INFO L93 Difference]: Finished difference Result 8247 states and 16407 transitions. [2022-03-01 16:49:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:18,367 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-03-01 16:49:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:18,382 INFO L225 Difference]: With dead ends: 8247 [2022-03-01 16:49:18,382 INFO L226 Difference]: Without dead ends: 8247 [2022-03-01 16:49:18,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:49:18,383 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 635 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:18,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 1273 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2022-03-01 16:49:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 3900. [2022-03-01 16:49:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3900 states, 3886 states have (on average 1.9848172928461143) internal successors, (7713), 3899 states have internal predecessors, (7713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 7713 transitions. [2022-03-01 16:49:18,464 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 7713 transitions. Word has length 105 [2022-03-01 16:49:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:18,464 INFO L470 AbstractCegarLoop]: Abstraction has 3900 states and 7713 transitions. [2022-03-01 16:49:18,464 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-03-01 16:49:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 7713 transitions. [2022-03-01 16:49:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:18,465 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:18,466 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-03-01 16:49:18,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:18,679 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-03-01 16:49:18,679 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -509932149, now seen corresponding path program 1 times [2022-03-01 16:49:18,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:18,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133863676] [2022-03-01 16:49:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:18,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:18,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133863676] [2022-03-01 16:49:18,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133863676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:18,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440509791] [2022-03-01 16:49:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:18,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:18,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:18,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:18,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 16:49:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:19,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:19,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:19,212 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-03-01 16:49:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:19,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:19,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440509791] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:19,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:19,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:19,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35131973] [2022-03-01 16:49:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:19,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:19,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:19,293 INFO L87 Difference]: Start difference. First operand 3900 states and 7713 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:19,789 INFO L93 Difference]: Finished difference Result 9773 states and 19440 transitions. [2022-03-01 16:49:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:19,789 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-03-01 16:49:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:19,805 INFO L225 Difference]: With dead ends: 9773 [2022-03-01 16:49:19,805 INFO L226 Difference]: Without dead ends: 9773 [2022-03-01 16:49:19,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:49:19,806 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 827 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:19,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1345 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2022-03-01 16:49:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 3903. [2022-03-01 16:49:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3889 states have (on average 1.9848290048855748) internal successors, (7719), 3902 states have internal predecessors, (7719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 7719 transitions. [2022-03-01 16:49:19,886 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 7719 transitions. Word has length 105 [2022-03-01 16:49:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:19,886 INFO L470 AbstractCegarLoop]: Abstraction has 3903 states and 7719 transitions. [2022-03-01 16:49:19,886 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-03-01 16:49:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 7719 transitions. [2022-03-01 16:49:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:19,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:19,888 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-03-01 16:49:19,904 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-03-01 16:49:20,103 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-03-01 16:49:20,104 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1481321675, now seen corresponding path program 2 times [2022-03-01 16:49:20,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:20,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598343888] [2022-03-01 16:49:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:20,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:20,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598343888] [2022-03-01 16:49:20,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598343888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:20,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270142332] [2022-03-01 16:49:20,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:20,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:20,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:20,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-01 16:49:20,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:20,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:20,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:20,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:20,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:49:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:20,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:20,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270142332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:20,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:20,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:20,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922666646] [2022-03-01 16:49:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:20,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:20,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:20,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:20,659 INFO L87 Difference]: Start difference. First operand 3903 states and 7719 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:21,345 INFO L93 Difference]: Finished difference Result 10247 states and 20388 transitions. [2022-03-01 16:49:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:21,345 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-03-01 16:49:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:21,364 INFO L225 Difference]: With dead ends: 10247 [2022-03-01 16:49:21,365 INFO L226 Difference]: Without dead ends: 10247 [2022-03-01 16:49:21,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:49:21,365 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1057 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:21,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 1473 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-03-01 16:49:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 3905. [2022-03-01 16:49:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 3891 states have (on average 1.9848368028784373) internal successors, (7723), 3904 states have internal predecessors, (7723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 7723 transitions. [2022-03-01 16:49:21,482 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 7723 transitions. Word has length 105 [2022-03-01 16:49:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:21,482 INFO L470 AbstractCegarLoop]: Abstraction has 3905 states and 7723 transitions. [2022-03-01 16:49:21,483 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-03-01 16:49:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 7723 transitions. [2022-03-01 16:49:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:21,484 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:21,484 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-03-01 16:49:21,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:21,700 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-03-01 16:49:21,700 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 428011595, now seen corresponding path program 3 times [2022-03-01 16:49:21,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:21,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466036341] [2022-03-01 16:49:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:21,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:21,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466036341] [2022-03-01 16:49:21,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466036341] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:21,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533153867] [2022-03-01 16:49:21,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:21,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-01 16:49:21,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:21,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:21,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:21,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:22,135 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-03-01 16:49:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:22,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:22,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533153867] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:22,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:22,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:49:22,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548022844] [2022-03-01 16:49:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:22,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:22,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:22,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:49:22,171 INFO L87 Difference]: Start difference. First operand 3905 states and 7723 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:23,212 INFO L93 Difference]: Finished difference Result 9750 states and 19370 transitions. [2022-03-01 16:49:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:23,213 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-03-01 16:49:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:23,227 INFO L225 Difference]: With dead ends: 9750 [2022-03-01 16:49:23,227 INFO L226 Difference]: Without dead ends: 9750 [2022-03-01 16:49:23,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:49:23,228 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1415 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:23,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1415 Valid, 1522 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:49:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2022-03-01 16:49:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 3925. [2022-03-01 16:49:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3911 states have (on average 1.9800562515980569) internal successors, (7744), 3924 states have internal predecessors, (7744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 7744 transitions. [2022-03-01 16:49:23,321 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 7744 transitions. Word has length 105 [2022-03-01 16:49:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:23,321 INFO L470 AbstractCegarLoop]: Abstraction has 3925 states and 7744 transitions. [2022-03-01 16:49:23,321 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-03-01 16:49:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 7744 transitions. [2022-03-01 16:49:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:23,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:23,323 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-03-01 16:49:23,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:23,538 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-03-01 16:49:23,538 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2091661697, now seen corresponding path program 4 times [2022-03-01 16:49:23,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:23,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742226452] [2022-03-01 16:49:23,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:23,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:23,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742226452] [2022-03-01 16:49:23,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742226452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:23,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214667609] [2022-03-01 16:49:23,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:23,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:23,795 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:23,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-01 16:49:23,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:23,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:23,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:23,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:24,188 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-03-01 16:49:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:24,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:24,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214667609] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:24,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:24,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:24,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433542441] [2022-03-01 16:49:24,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:24,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:24,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:24,228 INFO L87 Difference]: Start difference. First operand 3925 states and 7744 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:25,503 INFO L93 Difference]: Finished difference Result 13148 states and 26142 transitions. [2022-03-01 16:49:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 16:49:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:25,521 INFO L225 Difference]: With dead ends: 13148 [2022-03-01 16:49:25,521 INFO L226 Difference]: Without dead ends: 13148 [2022-03-01 16:49:25,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=373, Invalid=1883, Unknown=0, NotChecked=0, Total=2256 [2022-03-01 16:49:25,522 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 1482 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:25,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1482 Valid, 1936 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:49:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13148 states. [2022-03-01 16:49:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13148 to 3975. [2022-03-01 16:49:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-01 16:49:25,622 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-01 16:49:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:25,623 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-01 16:49:25,623 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-03-01 16:49:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-01 16:49:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:25,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:25,625 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-03-01 16:49:25,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:25,839 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-03-01 16:49:25,839 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1656374657, now seen corresponding path program 5 times [2022-03-01 16:49:25,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:25,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778585060] [2022-03-01 16:49:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:25,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:26,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:26,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778585060] [2022-03-01 16:49:26,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778585060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:26,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170802296] [2022-03-01 16:49:26,098 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:26,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:26,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:26,099 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:26,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-01 16:49:26,220 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:26,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:26,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:26,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:26,491 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-03-01 16:49:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:26,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:26,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170802296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:26,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:26,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:26,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176380307] [2022-03-01 16:49:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:26,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:26,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:26,544 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:27,288 INFO L93 Difference]: Finished difference Result 12864 states and 25565 transitions. [2022-03-01 16:49:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:27,288 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-03-01 16:49:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:27,305 INFO L225 Difference]: With dead ends: 12864 [2022-03-01 16:49:27,305 INFO L226 Difference]: Without dead ends: 12864 [2022-03-01 16:49:27,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:49:27,306 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 1063 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:27,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 1809 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2022-03-01 16:49:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 3977. [2022-03-01 16:49:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3963 states have (on average 1.980317940953823) internal successors, (7848), 3976 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 7848 transitions. [2022-03-01 16:49:27,401 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 7848 transitions. Word has length 105 [2022-03-01 16:49:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:27,401 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 7848 transitions. [2022-03-01 16:49:27,401 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-03-01 16:49:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 7848 transitions. [2022-03-01 16:49:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:27,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:27,405 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-03-01 16:49:27,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:27,619 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-03-01 16:49:27,619 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1169892031, now seen corresponding path program 6 times [2022-03-01 16:49:27,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:27,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943584657] [2022-03-01 16:49:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:27,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:27,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943584657] [2022-03-01 16:49:27,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943584657] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:27,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987134966] [2022-03-01 16:49:27,851 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:27,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:27,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:27,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:27,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-01 16:49:27,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:27,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:27,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:27,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:28,204 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-03-01 16:49:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:28,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:28,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987134966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:28,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:28,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:28,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876503344] [2022-03-01 16:49:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:28,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:28,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:28,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:28,239 INFO L87 Difference]: Start difference. First operand 3977 states and 7848 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:29,435 INFO L93 Difference]: Finished difference Result 13826 states and 27441 transitions. [2022-03-01 16:49:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:29,436 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-03-01 16:49:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:29,456 INFO L225 Difference]: With dead ends: 13826 [2022-03-01 16:49:29,456 INFO L226 Difference]: Without dead ends: 13826 [2022-03-01 16:49:29,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=1894, Unknown=0, NotChecked=0, Total=2256 [2022-03-01 16:49:29,457 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 1305 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:29,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1305 Valid, 2006 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-03-01 16:49:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 3975. [2022-03-01 16:49:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-01 16:49:29,556 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-01 16:49:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:29,556 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-01 16:49:29,556 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-03-01 16:49:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-01 16:49:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:29,558 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:29,558 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-03-01 16:49:29,577 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-03-01 16:49:29,775 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-03-01 16:49:29,775 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1363632863, now seen corresponding path program 7 times [2022-03-01 16:49:29,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:29,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099775134] [2022-03-01 16:49:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:30,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:30,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099775134] [2022-03-01 16:49:30,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099775134] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:30,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196491094] [2022-03-01 16:49:30,036 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:30,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:30,037 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:30,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 16:49:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:30,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:30,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:30,364 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-03-01 16:49:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:30,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:30,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196491094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:30,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:30,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:30,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382275753] [2022-03-01 16:49:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:30,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:30,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:30,445 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:30,959 INFO L93 Difference]: Finished difference Result 11072 states and 21976 transitions. [2022-03-01 16:49:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:49:30,960 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-03-01 16:49:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:30,973 INFO L225 Difference]: With dead ends: 11072 [2022-03-01 16:49:30,974 INFO L226 Difference]: Without dead ends: 11072 [2022-03-01 16:49:30,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-03-01 16:49:30,974 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 797 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:30,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 1543 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2022-03-01 16:49:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 3978. [2022-03-01 16:49:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3964 states have (on average 1.9803229061553986) internal successors, (7850), 3977 states have internal predecessors, (7850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 7850 transitions. [2022-03-01 16:49:31,066 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 7850 transitions. Word has length 105 [2022-03-01 16:49:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:31,067 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 7850 transitions. [2022-03-01 16:49:31,067 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-03-01 16:49:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 7850 transitions. [2022-03-01 16:49:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:31,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:31,069 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-03-01 16:49:31,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:31,283 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-03-01 16:49:31,283 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash -61562595, now seen corresponding path program 8 times [2022-03-01 16:49:31,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:31,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409225485] [2022-03-01 16:49:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:31,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:31,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:31,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409225485] [2022-03-01 16:49:31,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409225485] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:31,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87788938] [2022-03-01 16:49:31,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:31,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:31,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:31,493 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:31,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-01 16:49:31,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:31,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:31,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:31,824 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-03-01 16:49:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:31,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:31,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87788938] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:31,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:31,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:31,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326150295] [2022-03-01 16:49:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:31,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:31,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:31,882 INFO L87 Difference]: Start difference. First operand 3978 states and 7850 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:32,690 INFO L93 Difference]: Finished difference Result 12770 states and 25348 transitions. [2022-03-01 16:49:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:49:32,691 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-03-01 16:49:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:32,707 INFO L225 Difference]: With dead ends: 12770 [2022-03-01 16:49:32,707 INFO L226 Difference]: Without dead ends: 12770 [2022-03-01 16:49:32,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:49:32,708 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 931 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:32,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 1833 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:49:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2022-03-01 16:49:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 3980. [2022-03-01 16:49:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3966 states have (on average 1.9803328290468987) internal successors, (7854), 3979 states have internal predecessors, (7854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 7854 transitions. [2022-03-01 16:49:32,783 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 7854 transitions. Word has length 105 [2022-03-01 16:49:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:32,783 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 7854 transitions. [2022-03-01 16:49:32,783 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-03-01 16:49:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 7854 transitions. [2022-03-01 16:49:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:32,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:32,785 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-03-01 16:49:32,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:33,001 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-03-01 16:49:33,001 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1114872675, now seen corresponding path program 9 times [2022-03-01 16:49:33,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:33,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206494912] [2022-03-01 16:49:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:33,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:33,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206494912] [2022-03-01 16:49:33,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206494912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:33,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127989188] [2022-03-01 16:49:33,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:33,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:33,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:33,178 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:49:33,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-01 16:49:33,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:33,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:33,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:33,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:33,541 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-03-01 16:49:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:33,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:33,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127989188] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:33,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:33,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:33,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653407020] [2022-03-01 16:49:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:33,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:33,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:33,574 INFO L87 Difference]: Start difference. First operand 3980 states and 7854 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:34,636 INFO L93 Difference]: Finished difference Result 12273 states and 24330 transitions. [2022-03-01 16:49:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:34,637 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-03-01 16:49:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:34,652 INFO L225 Difference]: With dead ends: 12273 [2022-03-01 16:49:34,652 INFO L226 Difference]: Without dead ends: 12273 [2022-03-01 16:49:34,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:49:34,653 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 1214 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:34,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1939 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2022-03-01 16:49:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 3975. [2022-03-01 16:49:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3961 states have (on average 1.980308003029538) internal successors, (7844), 3974 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 7844 transitions. [2022-03-01 16:49:34,727 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 7844 transitions. Word has length 105 [2022-03-01 16:49:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:34,727 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 7844 transitions. [2022-03-01 16:49:34,727 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-03-01 16:49:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 7844 transitions. [2022-03-01 16:49:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:34,729 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:34,729 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-03-01 16:49:34,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:34,945 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-03-01 16:49:34,946 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1959628071, now seen corresponding path program 10 times [2022-03-01 16:49:34,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:34,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382143553] [2022-03-01 16:49:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:35,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:35,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382143553] [2022-03-01 16:49:35,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382143553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:35,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708006993] [2022-03-01 16:49:35,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:35,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:35,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:35,218 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-03-01 16:49:35,219 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-03-01 16:49:35,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:35,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:35,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:35,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:35,534 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-03-01 16:49:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:35,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:35,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708006993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:35,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:35,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-01 16:49:35,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915773974] [2022-03-01 16:49:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:35,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:35,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:35,607 INFO L87 Difference]: Start difference. First operand 3975 states and 7844 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:36,188 INFO L93 Difference]: Finished difference Result 9102 states and 18079 transitions. [2022-03-01 16:49:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:49:36,188 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-03-01 16:49:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:36,197 INFO L225 Difference]: With dead ends: 9102 [2022-03-01 16:49:36,197 INFO L226 Difference]: Without dead ends: 9102 [2022-03-01 16:49:36,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:49:36,198 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 747 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:36,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 1269 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-03-01 16:49:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 4050. [2022-03-01 16:49:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:36,253 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:36,253 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:36,254 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-03-01 16:49:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:36,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:36,255 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-03-01 16:49:36,275 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-03-01 16:49:36,473 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-03-01 16:49:36,474 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2128369343, now seen corresponding path program 11 times [2022-03-01 16:49:36,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:36,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813515805] [2022-03-01 16:49:36,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:36,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:36,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:36,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813515805] [2022-03-01 16:49:36,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813515805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:36,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129397063] [2022-03-01 16:49:36,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:36,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:36,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:36,697 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-03-01 16:49:36,698 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-03-01 16:49:36,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:36,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:36,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:36,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:37,112 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-03-01 16:49:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:37,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:37,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129397063] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:37,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:37,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:37,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580303802] [2022-03-01 16:49:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:37,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:37,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:37,152 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:38,090 INFO L93 Difference]: Finished difference Result 10156 states and 20144 transitions. [2022-03-01 16:49:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:38,092 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-03-01 16:49:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:38,102 INFO L225 Difference]: With dead ends: 10156 [2022-03-01 16:49:38,102 INFO L226 Difference]: Without dead ends: 10156 [2022-03-01 16:49:38,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:38,102 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 1089 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:38,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1089 Valid, 1624 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:49:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2022-03-01 16:49:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 4050. [2022-03-01 16:49:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:38,164 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:38,164 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:38,164 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-03-01 16:49:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:38,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:38,166 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-03-01 16:49:38,184 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-03-01 16:49:38,379 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-03-01 16:49:38,379 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -16501203, now seen corresponding path program 12 times [2022-03-01 16:49:38,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:38,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070570180] [2022-03-01 16:49:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:38,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:38,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070570180] [2022-03-01 16:49:38,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070570180] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:38,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959410991] [2022-03-01 16:49:38,534 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:38,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:38,535 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-03-01 16:49:38,540 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-03-01 16:49:38,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:38,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:38,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:38,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:38,899 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-03-01 16:49:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:38,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:38,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959410991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:38,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:38,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:38,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74559804] [2022-03-01 16:49:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:38,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:38,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:38,931 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:39,975 INFO L93 Difference]: Finished difference Result 14218 states and 28225 transitions. [2022-03-01 16:49:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:39,975 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-03-01 16:49:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:39,991 INFO L225 Difference]: With dead ends: 14218 [2022-03-01 16:49:39,991 INFO L226 Difference]: Without dead ends: 14218 [2022-03-01 16:49:39,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:39,992 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1402 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:39,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1988 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2022-03-01 16:49:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 4054. [2022-03-01 16:49:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 4040 states have (on average 1.9806930693069307) internal successors, (8002), 4053 states have internal predecessors, (8002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 8002 transitions. [2022-03-01 16:49:40,070 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 8002 transitions. Word has length 105 [2022-03-01 16:49:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:40,070 INFO L470 AbstractCegarLoop]: Abstraction has 4054 states and 8002 transitions. [2022-03-01 16:49:40,070 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-03-01 16:49:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 8002 transitions. [2022-03-01 16:49:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:40,072 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:40,072 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-03-01 16:49:40,088 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-03-01 16:49:40,272 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-03-01 16:49:40,272 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -563432145, now seen corresponding path program 13 times [2022-03-01 16:49:40,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:40,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136732831] [2022-03-01 16:49:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:40,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:40,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136732831] [2022-03-01 16:49:40,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136732831] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:40,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904438516] [2022-03-01 16:49:40,420 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:40,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:40,422 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-03-01 16:49:40,423 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-03-01 16:49:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:40,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:40,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:40,758 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-03-01 16:49:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:40,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:40,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904438516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:40,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:40,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:40,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950625519] [2022-03-01 16:49:40,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:40,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:40,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:40,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:40,811 INFO L87 Difference]: Start difference. First operand 4054 states and 8002 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:41,329 INFO L93 Difference]: Finished difference Result 9882 states and 19601 transitions. [2022-03-01 16:49:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:49:41,329 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-03-01 16:49:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:41,341 INFO L225 Difference]: With dead ends: 9882 [2022-03-01 16:49:41,341 INFO L226 Difference]: Without dead ends: 9882 [2022-03-01 16:49:41,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-03-01 16:49:41,342 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 856 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:41,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 1470 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9882 states. [2022-03-01 16:49:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9882 to 4056. [2022-03-01 16:49:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4042 states have (on average 1.9807026224641266) internal successors, (8006), 4055 states have internal predecessors, (8006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-01 16:49:41,427 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-01 16:49:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:41,427 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-01 16:49:41,427 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-03-01 16:49:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-01 16:49:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:41,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:41,429 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-03-01 16:49:41,446 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-03-01 16:49:41,635 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-03-01 16:49:41,635 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1049914771, now seen corresponding path program 14 times [2022-03-01 16:49:41,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:41,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9241500] [2022-03-01 16:49:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:41,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:41,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9241500] [2022-03-01 16:49:41,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9241500] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:41,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88453855] [2022-03-01 16:49:41,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:41,868 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-03-01 16:49:41,868 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-03-01 16:49:41,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:41,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:41,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:41,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:42,234 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-03-01 16:49:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:42,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:42,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88453855] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:42,269 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:42,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:42,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189916412] [2022-03-01 16:49:42,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:42,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:42,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:42,271 INFO L87 Difference]: Start difference. First operand 4056 states and 8006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:43,224 INFO L93 Difference]: Finished difference Result 10977 states and 21724 transitions. [2022-03-01 16:49:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:43,224 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-03-01 16:49:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:43,238 INFO L225 Difference]: With dead ends: 10977 [2022-03-01 16:49:43,238 INFO L226 Difference]: Without dead ends: 10977 [2022-03-01 16:49:43,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1456, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:43,239 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1081 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:43,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1081 Valid, 1915 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:49:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10977 states. [2022-03-01 16:49:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10977 to 4050. [2022-03-01 16:49:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:43,320 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:43,320 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:43,321 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-03-01 16:49:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:43,322 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:43,322 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-03-01 16:49:43,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-01 16:49:43,523 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-03-01 16:49:43,523 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash -550224723, now seen corresponding path program 15 times [2022-03-01 16:49:43,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:43,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760295775] [2022-03-01 16:49:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:43,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:43,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760295775] [2022-03-01 16:49:43,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760295775] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:43,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37819017] [2022-03-01 16:49:43,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:43,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:43,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:43,786 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-03-01 16:49:43,787 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-03-01 16:49:43,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:43,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:43,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:43,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:44,146 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-03-01 16:49:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:44,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:44,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37819017] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:44,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:44,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:44,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077618713] [2022-03-01 16:49:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:44,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:44,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:44,192 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:45,323 INFO L93 Difference]: Finished difference Result 12897 states and 25597 transitions. [2022-03-01 16:49:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:49:45,324 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-03-01 16:49:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:45,343 INFO L225 Difference]: With dead ends: 12897 [2022-03-01 16:49:45,343 INFO L226 Difference]: Without dead ends: 12897 [2022-03-01 16:49:45,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2022-03-01 16:49:45,344 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1626 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:45,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 1979 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2022-03-01 16:49:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 4060. [2022-03-01 16:49:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4046 states have (on average 1.9807217004448838) internal successors, (8014), 4059 states have internal predecessors, (8014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 8014 transitions. [2022-03-01 16:49:45,454 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 8014 transitions. Word has length 105 [2022-03-01 16:49:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:45,454 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 8014 transitions. [2022-03-01 16:49:45,454 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-03-01 16:49:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 8014 transitions. [2022-03-01 16:49:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:45,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:45,456 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-03-01 16:49:45,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-01 16:49:45,656 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-03-01 16:49:45,657 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1097155665, now seen corresponding path program 16 times [2022-03-01 16:49:45,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:45,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531039264] [2022-03-01 16:49:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:45,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:45,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531039264] [2022-03-01 16:49:45,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531039264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:45,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929834421] [2022-03-01 16:49:45,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:45,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:45,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:45,895 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-03-01 16:49:45,896 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-03-01 16:49:46,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:46,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:46,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:46,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:46,262 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-03-01 16:49:46,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-03-01 16:49:46,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:46,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929834421] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:46,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:46,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2022-03-01 16:49:46,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611998296] [2022-03-01 16:49:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:46,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:46,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:49:46,305 INFO L87 Difference]: Start difference. First operand 4060 states and 8014 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:47,240 INFO L93 Difference]: Finished difference Result 16275 states and 32325 transitions. [2022-03-01 16:49:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 16:49:47,241 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-03-01 16:49:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:47,262 INFO L225 Difference]: With dead ends: 16275 [2022-03-01 16:49:47,263 INFO L226 Difference]: Without dead ends: 16275 [2022-03-01 16:49:47,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:47,264 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1363 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:47,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 2184 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2022-03-01 16:49:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 4062. [2022-03-01 16:49:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4048 states have (on average 1.9807312252964426) internal successors, (8018), 4061 states have internal predecessors, (8018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 8018 transitions. [2022-03-01 16:49:47,380 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 8018 transitions. Word has length 105 [2022-03-01 16:49:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:47,380 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 8018 transitions. [2022-03-01 16:49:47,381 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-03-01 16:49:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 8018 transitions. [2022-03-01 16:49:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:47,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:47,382 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-03-01 16:49:47,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-01 16:49:47,587 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-03-01 16:49:47,587 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1583638291, now seen corresponding path program 17 times [2022-03-01 16:49:47,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:47,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133446666] [2022-03-01 16:49:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:47,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:47,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133446666] [2022-03-01 16:49:47,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133446666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:47,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682416642] [2022-03-01 16:49:47,800 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:47,804 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-03-01 16:49:47,805 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-03-01 16:49:47,974 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:47,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:47,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:47,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:48,221 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-03-01 16:49:48,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-03-01 16:49:48,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:48,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682416642] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:48,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:48,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:48,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227602999] [2022-03-01 16:49:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:48,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:48,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:48,257 INFO L87 Difference]: Start difference. First operand 4062 states and 8018 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:49,360 INFO L93 Difference]: Finished difference Result 13575 states and 26896 transitions. [2022-03-01 16:49:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:49:49,360 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-03-01 16:49:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:49,377 INFO L225 Difference]: With dead ends: 13575 [2022-03-01 16:49:49,377 INFO L226 Difference]: Without dead ends: 13575 [2022-03-01 16:49:49,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 16:49:49,378 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 1337 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:49,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1337 Valid, 2129 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2022-03-01 16:49:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 4056. [2022-03-01 16:49:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4042 states have (on average 1.9807026224641266) internal successors, (8006), 4055 states have internal predecessors, (8006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 8006 transitions. [2022-03-01 16:49:49,455 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 8006 transitions. Word has length 105 [2022-03-01 16:49:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:49,456 INFO L470 AbstractCegarLoop]: Abstraction has 4056 states and 8006 transitions. [2022-03-01 16:49:49,456 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-03-01 16:49:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 8006 transitions. [2022-03-01 16:49:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:49,468 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:49,468 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-03-01 16:49:49,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-01 16:49:49,680 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-03-01 16:49:49,680 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1389897459, now seen corresponding path program 18 times [2022-03-01 16:49:49,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:49,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532066920] [2022-03-01 16:49:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:49,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:49,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532066920] [2022-03-01 16:49:49,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532066920] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:49,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727771928] [2022-03-01 16:49:49,829 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:49:49,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:49,830 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-03-01 16:49:49,831 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-03-01 16:49:49,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:49:49,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:49,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:49,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:50,146 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-03-01 16:49:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:50,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:50,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727771928] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:50,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:50,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:50,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028431912] [2022-03-01 16:49:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:50,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:50,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:50,217 INFO L87 Difference]: Start difference. First operand 4056 states and 8006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:50,662 INFO L93 Difference]: Finished difference Result 8414 states and 16665 transitions. [2022-03-01 16:49:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:50,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 16:49:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:50,673 INFO L225 Difference]: With dead ends: 8414 [2022-03-01 16:49:50,673 INFO L226 Difference]: Without dead ends: 8414 [2022-03-01 16:49:50,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:49:50,674 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 642 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:50,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 1493 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:49:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2022-03-01 16:49:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4059. [2022-03-01 16:49:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4045 states have (on average 1.980716934487021) internal successors, (8012), 4058 states have internal predecessors, (8012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 8012 transitions. [2022-03-01 16:49:50,734 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 8012 transitions. Word has length 105 [2022-03-01 16:49:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:50,734 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 8012 transitions. [2022-03-01 16:49:50,734 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-03-01 16:49:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 8012 transitions. [2022-03-01 16:49:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:50,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:50,736 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-03-01 16:49:50,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-01 16:49:50,936 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-03-01 16:49:50,936 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1479874379, now seen corresponding path program 19 times [2022-03-01 16:49:50,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:50,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105903901] [2022-03-01 16:49:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:51,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:51,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105903901] [2022-03-01 16:49:51,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105903901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:51,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706820822] [2022-03-01 16:49:51,169 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:49:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:51,172 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-03-01 16:49:51,173 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-03-01 16:49:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:51,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:51,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:51,576 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-03-01 16:49:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:51,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:51,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706820822] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:51,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:51,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:51,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132375660] [2022-03-01 16:49:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:51,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:51,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:51,637 INFO L87 Difference]: Start difference. First operand 4059 states and 8012 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:52,286 INFO L93 Difference]: Finished difference Result 10112 states and 20037 transitions. [2022-03-01 16:49:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:49:52,286 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-03-01 16:49:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:52,297 INFO L225 Difference]: With dead ends: 10112 [2022-03-01 16:49:52,297 INFO L226 Difference]: Without dead ends: 10112 [2022-03-01 16:49:52,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2022-03-01 16:49:52,298 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 821 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:52,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 1682 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. [2022-03-01 16:49:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 4061. [2022-03-01 16:49:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4061 states, 4047 states have (on average 1.9807264640474425) internal successors, (8016), 4060 states have internal predecessors, (8016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 8016 transitions. [2022-03-01 16:49:52,359 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 8016 transitions. Word has length 105 [2022-03-01 16:49:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:52,359 INFO L470 AbstractCegarLoop]: Abstraction has 4061 states and 8016 transitions. [2022-03-01 16:49:52,359 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-03-01 16:49:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 8016 transitions. [2022-03-01 16:49:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:52,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:52,360 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-03-01 16:49:52,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:52,561 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-03-01 16:49:52,561 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 426564299, now seen corresponding path program 20 times [2022-03-01 16:49:52,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:52,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550228945] [2022-03-01 16:49:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:52,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:52,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550228945] [2022-03-01 16:49:52,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550228945] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:52,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685822560] [2022-03-01 16:49:52,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:49:52,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:52,802 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-03-01 16:49:52,813 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-03-01 16:49:52,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:49:52,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:52,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:52,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:53,185 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-03-01 16:49:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:53,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:53,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685822560] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:53,220 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:53,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:53,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559511015] [2022-03-01 16:49:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:53,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:53,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:53,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:53,221 INFO L87 Difference]: Start difference. First operand 4061 states and 8016 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:54,218 INFO L93 Difference]: Finished difference Result 9615 states and 19019 transitions. [2022-03-01 16:49:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:49:54,218 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-03-01 16:49:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:54,230 INFO L225 Difference]: With dead ends: 9615 [2022-03-01 16:49:54,230 INFO L226 Difference]: Without dead ends: 9615 [2022-03-01 16:49:54,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:49:54,231 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1091 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:54,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1797 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2022-03-01 16:49:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 4050. [2022-03-01 16:49:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4036 states have (on average 1.9806739345887017) internal successors, (7994), 4049 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 7994 transitions. [2022-03-01 16:49:54,308 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 7994 transitions. Word has length 105 [2022-03-01 16:49:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:54,309 INFO L470 AbstractCegarLoop]: Abstraction has 4050 states and 7994 transitions. [2022-03-01 16:49:54,309 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-03-01 16:49:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 7994 transitions. [2022-03-01 16:49:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:54,310 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:54,310 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-03-01 16:49:54,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:54,515 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-03-01 16:49:54,515 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2124234257, now seen corresponding path program 21 times [2022-03-01 16:49:54,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:54,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625127734] [2022-03-01 16:49:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:54,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:54,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625127734] [2022-03-01 16:49:54,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625127734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:54,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419780502] [2022-03-01 16:49:54,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:49:54,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:54,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:54,693 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-03-01 16:49:54,694 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-03-01 16:49:54,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:49:54,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:54,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:54,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:55,033 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-03-01 16:49:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:55,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:55,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419780502] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:55,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:55,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:49:55,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858686085] [2022-03-01 16:49:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:55,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:55,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:55,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:49:55,150 INFO L87 Difference]: Start difference. First operand 4050 states and 7994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:55,679 INFO L93 Difference]: Finished difference Result 7878 states and 15626 transitions. [2022-03-01 16:49:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:49:55,679 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-03-01 16:49:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:55,688 INFO L225 Difference]: With dead ends: 7878 [2022-03-01 16:49:55,689 INFO L226 Difference]: Without dead ends: 7878 [2022-03-01 16:49:55,689 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-03-01 16:49:55,689 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 827 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:55,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 1648 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:49:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-03-01 16:49:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 4086. [2022-03-01 16:49:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-01 16:49:55,743 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-01 16:49:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:55,744 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-01 16:49:55,744 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-03-01 16:49:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-01 16:49:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:55,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:55,745 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-03-01 16:49:55,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-01 16:49:55,946 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-03-01 16:49:55,946 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1798897081, now seen corresponding path program 22 times [2022-03-01 16:49:55,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:55,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571280239] [2022-03-01 16:49:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:56,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:56,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571280239] [2022-03-01 16:49:56,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571280239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:56,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424399674] [2022-03-01 16:49:56,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:49:56,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:56,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:56,196 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-03-01 16:49:56,197 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-03-01 16:49:56,392 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:49:56,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:56,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:49:56,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:56,563 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-03-01 16:49:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:56,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:56,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424399674] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:56,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:56,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-03-01 16:49:56,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462651383] [2022-03-01 16:49:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:56,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:49:56,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:49:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:56,632 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:57,455 INFO L93 Difference]: Finished difference Result 9039 states and 17934 transitions. [2022-03-01 16:49:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 16:49:57,456 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-03-01 16:49:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:57,469 INFO L225 Difference]: With dead ends: 9039 [2022-03-01 16:49:57,470 INFO L226 Difference]: Without dead ends: 9039 [2022-03-01 16:49:57,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:49:57,471 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 1028 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:57,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 1612 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2022-03-01 16:49:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 4089. [2022-03-01 16:49:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 4075 states have (on average 1.9808588957055215) internal successors, (8072), 4088 states have internal predecessors, (8072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 8072 transitions. [2022-03-01 16:49:57,545 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 8072 transitions. Word has length 105 [2022-03-01 16:49:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:57,546 INFO L470 AbstractCegarLoop]: Abstraction has 4089 states and 8072 transitions. [2022-03-01 16:49:57,546 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-03-01 16:49:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 8072 transitions. [2022-03-01 16:49:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:57,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:57,547 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-03-01 16:49:57,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:57,773 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-03-01 16:49:57,773 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2005866963, now seen corresponding path program 23 times [2022-03-01 16:49:57,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:57,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311320774] [2022-03-01 16:49:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:49:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:49:57,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:49:57,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311320774] [2022-03-01 16:49:57,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311320774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:49:57,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93473820] [2022-03-01 16:49:57,988 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:49:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:49:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:49:57,990 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-03-01 16:49:57,991 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-03-01 16:49:58,175 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:49:58,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:49:58,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:49:58,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:49:58,427 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-03-01 16:49:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:49:58,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:49:58,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93473820] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:49:58,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:49:58,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:49:58,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952146988] [2022-03-01 16:49:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:49:58,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:49:58,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:49:58,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:49:58,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:49:58,464 INFO L87 Difference]: Start difference. First operand 4089 states and 8072 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:49:59,671 INFO L93 Difference]: Finished difference Result 9474 states and 18775 transitions. [2022-03-01 16:49:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:49:59,671 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-03-01 16:49:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:49:59,682 INFO L225 Difference]: With dead ends: 9474 [2022-03-01 16:49:59,682 INFO L226 Difference]: Without dead ends: 9474 [2022-03-01 16:49:59,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1876, Unknown=0, NotChecked=0, Total=2256 [2022-03-01 16:49:59,684 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 1402 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:49:59,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 1934 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:49:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2022-03-01 16:49:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 4086. [2022-03-01 16:49:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:49:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-01 16:49:59,743 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-01 16:49:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:49:59,743 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-01 16:49:59,743 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-03-01 16:49:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-01 16:49:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:49:59,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:49:59,744 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-03-01 16:49:59,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-01 16:49:59,945 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-03-01 16:49:59,945 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:49:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:49:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2128263501, now seen corresponding path program 24 times [2022-03-01 16:49:59,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:49:59,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86723415] [2022-03-01 16:49:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:49:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:49:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:00,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:00,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86723415] [2022-03-01 16:50:00,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86723415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:00,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991746429] [2022-03-01 16:50:00,112 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:00,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:00,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:00,113 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-03-01 16:50:00,155 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-03-01 16:50:00,297 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:00,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:00,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:00,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:00,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 13 treesize of output 9 [2022-03-01 16:50:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:00,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:00,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991746429] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:00,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:00,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:00,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603196505] [2022-03-01 16:50:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:00,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:00,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:00,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:00,559 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:01,040 INFO L93 Difference]: Finished difference Result 8122 states and 16081 transitions. [2022-03-01 16:50:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:50:01,040 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-03-01 16:50:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:01,049 INFO L225 Difference]: With dead ends: 8122 [2022-03-01 16:50:01,049 INFO L226 Difference]: Without dead ends: 8122 [2022-03-01 16:50:01,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:50:01,050 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 714 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:01,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 1686 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-03-01 16:50:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 4095. [2022-03-01 16:50:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 4081 states have (on average 1.9808870374908112) internal successors, (8084), 4094 states have internal predecessors, (8084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 8084 transitions. [2022-03-01 16:50:01,122 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 8084 transitions. Word has length 105 [2022-03-01 16:50:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:01,122 INFO L470 AbstractCegarLoop]: Abstraction has 4095 states and 8084 transitions. [2022-03-01 16:50:01,122 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-03-01 16:50:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 8084 transitions. [2022-03-01 16:50:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:01,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:01,123 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-03-01 16:50:01,142 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-03-01 16:50:01,335 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-03-01 16:50:01,335 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1959733913, now seen corresponding path program 25 times [2022-03-01 16:50:01,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:01,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019703809] [2022-03-01 16:50:01,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:01,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:01,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:01,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019703809] [2022-03-01 16:50:01,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019703809] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:01,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673495079] [2022-03-01 16:50:01,437 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:01,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:01,438 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-03-01 16:50:01,455 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-03-01 16:50:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:01,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:01,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:01,857 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-03-01 16:50:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:01,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:01,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673495079] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:01,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:01,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:01,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118107185] [2022-03-01 16:50:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:01,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:01,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:01,890 INFO L87 Difference]: Start difference. First operand 4095 states and 8084 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:03,085 INFO L93 Difference]: Finished difference Result 11081 states and 21956 transitions. [2022-03-01 16:50:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:03,091 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-03-01 16:50:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:03,113 INFO L225 Difference]: With dead ends: 11081 [2022-03-01 16:50:03,113 INFO L226 Difference]: Without dead ends: 11081 [2022-03-01 16:50:03,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:50:03,114 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 1397 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:03,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 1899 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:50:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11081 states. [2022-03-01 16:50:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11081 to 4092. [2022-03-01 16:50:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-01 16:50:03,195 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-01 16:50:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:03,196 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-01 16:50:03,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-03-01 16:50:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-01 16:50:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:03,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:03,197 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-03-01 16:50:03,215 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-03-01 16:50:03,407 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-03-01 16:50:03,407 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash -185136633, now seen corresponding path program 26 times [2022-03-01 16:50:03,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:03,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413025389] [2022-03-01 16:50:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:03,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:03,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413025389] [2022-03-01 16:50:03,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413025389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:03,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273010342] [2022-03-01 16:50:03,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:03,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:03,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:03,506 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-03-01 16:50:03,508 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-03-01 16:50:03,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:03,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:03,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:03,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:03,966 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-03-01 16:50:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:03,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:03,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273010342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:03,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:03,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:03,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668346545] [2022-03-01 16:50:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:03,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:03,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:03,999 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:05,150 INFO L93 Difference]: Finished difference Result 13372 states and 26547 transitions. [2022-03-01 16:50:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 16:50:05,150 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-03-01 16:50:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:05,170 INFO L225 Difference]: With dead ends: 13372 [2022-03-01 16:50:05,170 INFO L226 Difference]: Without dead ends: 13372 [2022-03-01 16:50:05,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:50:05,171 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 1599 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:05,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 2049 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:50:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2022-03-01 16:50:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 4096. [2022-03-01 16:50:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4096 states, 4082 states have (on average 1.980891719745223) internal successors, (8086), 4095 states have internal predecessors, (8086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 4096 states and 8086 transitions. [2022-03-01 16:50:05,257 INFO L78 Accepts]: Start accepts. Automaton has 4096 states and 8086 transitions. Word has length 105 [2022-03-01 16:50:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:05,257 INFO L470 AbstractCegarLoop]: Abstraction has 4096 states and 8086 transitions. [2022-03-01 16:50:05,257 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-03-01 16:50:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4096 states and 8086 transitions. [2022-03-01 16:50:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:05,259 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:05,259 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-03-01 16:50:05,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-03-01 16:50:05,459 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-03-01 16:50:05,459 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash -732067575, now seen corresponding path program 27 times [2022-03-01 16:50:05,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:05,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980591900] [2022-03-01 16:50:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:05,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:05,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980591900] [2022-03-01 16:50:05,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980591900] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:05,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590530341] [2022-03-01 16:50:05,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:05,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:05,720 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-03-01 16:50:05,720 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-03-01 16:50:05,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:05,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:05,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:05,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:06,111 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-03-01 16:50:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:06,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:06,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590530341] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:06,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:06,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:06,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828853984] [2022-03-01 16:50:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:06,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:06,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:06,165 INFO L87 Difference]: Start difference. First operand 4096 states and 8086 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:06,866 INFO L93 Difference]: Finished difference Result 9134 states and 18105 transitions. [2022-03-01 16:50:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:50:06,866 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-03-01 16:50:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:06,878 INFO L225 Difference]: With dead ends: 9134 [2022-03-01 16:50:06,878 INFO L226 Difference]: Without dead ends: 9134 [2022-03-01 16:50:06,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:50:06,879 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 1087 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:06,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1762 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2022-03-01 16:50:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 4098. [2022-03-01 16:50:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4084 states have (on average 1.9809010773751223) internal successors, (8090), 4097 states have internal predecessors, (8090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8090 transitions. [2022-03-01 16:50:06,951 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8090 transitions. Word has length 105 [2022-03-01 16:50:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:06,952 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 8090 transitions. [2022-03-01 16:50:06,952 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-03-01 16:50:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8090 transitions. [2022-03-01 16:50:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:06,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:06,953 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-03-01 16:50:06,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-01 16:50:07,154 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-03-01 16:50:07,154 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1218550201, now seen corresponding path program 28 times [2022-03-01 16:50:07,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:07,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892104470] [2022-03-01 16:50:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:07,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:07,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:07,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892104470] [2022-03-01 16:50:07,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892104470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:07,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104098750] [2022-03-01 16:50:07,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:50:07,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:07,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:07,256 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-03-01 16:50:07,258 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-03-01 16:50:07,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:50:07,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:07,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:50:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:07,621 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-03-01 16:50:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:07,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:07,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104098750] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:07,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:07,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-01 16:50:07,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527303725] [2022-03-01 16:50:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:07,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:50:07,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:07,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:50:07,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:50:07,655 INFO L87 Difference]: Start difference. First operand 4098 states and 8090 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:08,772 INFO L93 Difference]: Finished difference Result 12493 states and 24756 transitions. [2022-03-01 16:50:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 16:50:08,772 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-03-01 16:50:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:08,789 INFO L225 Difference]: With dead ends: 12493 [2022-03-01 16:50:08,789 INFO L226 Difference]: Without dead ends: 12493 [2022-03-01 16:50:08,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:50:08,790 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 1251 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:08,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 2202 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:50:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2022-03-01 16:50:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 4086. [2022-03-01 16:50:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4072 states have (on average 1.980844793713163) internal successors, (8066), 4085 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8066 transitions. [2022-03-01 16:50:08,857 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8066 transitions. Word has length 105 [2022-03-01 16:50:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:08,857 INFO L470 AbstractCegarLoop]: Abstraction has 4086 states and 8066 transitions. [2022-03-01 16:50:08,857 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-03-01 16:50:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8066 transitions. [2022-03-01 16:50:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:08,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:08,859 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-03-01 16:50:08,878 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-03-01 16:50:09,059 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-03-01 16:50:09,059 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1585962891, now seen corresponding path program 29 times [2022-03-01 16:50:09,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:09,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040052448] [2022-03-01 16:50:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:09,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:09,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040052448] [2022-03-01 16:50:09,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040052448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:09,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71123072] [2022-03-01 16:50:09,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:09,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:09,220 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-03-01 16:50:09,221 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-03-01 16:50:09,418 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:09,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:09,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:09,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:09,619 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-03-01 16:50:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:09,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:09,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71123072] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:09,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:09,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:09,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440158108] [2022-03-01 16:50:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:09,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:09,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:09,705 INFO L87 Difference]: Start difference. First operand 4086 states and 8066 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:10,166 INFO L93 Difference]: Finished difference Result 7570 states and 14977 transitions. [2022-03-01 16:50:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:50:10,166 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-03-01 16:50:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:10,177 INFO L225 Difference]: With dead ends: 7570 [2022-03-01 16:50:10,177 INFO L226 Difference]: Without dead ends: 7570 [2022-03-01 16:50:10,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:50:10,178 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 611 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:10,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1626 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2022-03-01 16:50:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 4091. [2022-03-01 16:50:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4077 states have (on average 1.9808682855040471) internal successors, (8076), 4090 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-01 16:50:10,237 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-01 16:50:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:10,238 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-01 16:50:10,238 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-03-01 16:50:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-01 16:50:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:10,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:10,239 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-03-01 16:50:10,258 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-03-01 16:50:10,439 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-03-01 16:50:10,440 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1792932773, now seen corresponding path program 30 times [2022-03-01 16:50:10,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:10,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240259331] [2022-03-01 16:50:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:10,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:10,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240259331] [2022-03-01 16:50:10,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240259331] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:10,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378330336] [2022-03-01 16:50:10,543 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:10,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:10,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:10,544 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-03-01 16:50:10,545 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-03-01 16:50:10,750 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:10,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:10,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:11,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-03-01 16:50:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:11,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:11,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378330336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:11,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:11,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:11,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848578792] [2022-03-01 16:50:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:11,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:11,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:11,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:11,037 INFO L87 Difference]: Start difference. First operand 4091 states and 8076 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:11,994 INFO L93 Difference]: Finished difference Result 10529 states and 20852 transitions. [2022-03-01 16:50:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:50:11,994 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-03-01 16:50:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:12,009 INFO L225 Difference]: With dead ends: 10529 [2022-03-01 16:50:12,009 INFO L226 Difference]: Without dead ends: 10529 [2022-03-01 16:50:12,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:50:12,011 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 1306 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:12,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1306 Valid, 1861 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:50:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10529 states. [2022-03-01 16:50:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10529 to 4088. [2022-03-01 16:50:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4074 states have (on average 1.9808541973490428) internal successors, (8070), 4087 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-01 16:50:12,084 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-01 16:50:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:12,084 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-01 16:50:12,084 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-03-01 16:50:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-01 16:50:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:12,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:12,086 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-03-01 16:50:12,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:12,290 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-03-01 16:50:12,290 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 357163977, now seen corresponding path program 31 times [2022-03-01 16:50:12,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:12,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389419528] [2022-03-01 16:50:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:12,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:12,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389419528] [2022-03-01 16:50:12,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389419528] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:12,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783206190] [2022-03-01 16:50:12,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:12,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:12,486 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-03-01 16:50:12,487 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-03-01 16:50:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:12,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:12,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:12,926 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-03-01 16:50:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:12,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:12,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783206190] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:12,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:12,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:12,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862026608] [2022-03-01 16:50:12,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:12,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:12,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:12,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:12,963 INFO L87 Difference]: Start difference. First operand 4088 states and 8070 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:14,187 INFO L93 Difference]: Finished difference Result 14591 states and 28933 transitions. [2022-03-01 16:50:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:50:14,187 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-03-01 16:50:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:14,207 INFO L225 Difference]: With dead ends: 14591 [2022-03-01 16:50:14,207 INFO L226 Difference]: Without dead ends: 14591 [2022-03-01 16:50:14,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-03-01 16:50:14,208 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 1598 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:14,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1598 Valid, 2220 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:50:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2022-03-01 16:50:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 4092. [2022-03-01 16:50:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-01 16:50:14,289 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-01 16:50:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:14,289 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-01 16:50:14,289 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-03-01 16:50:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-01 16:50:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:14,291 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:14,291 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-03-01 16:50:14,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:14,507 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-03-01 16:50:14,508 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash -189766965, now seen corresponding path program 32 times [2022-03-01 16:50:14,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:14,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361987036] [2022-03-01 16:50:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:14,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:14,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361987036] [2022-03-01 16:50:14,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361987036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:14,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651258497] [2022-03-01 16:50:14,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:14,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:14,707 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-03-01 16:50:14,707 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-03-01 16:50:14,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:14,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:14,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:14,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:15,109 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-03-01 16:50:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:15,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:15,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651258497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:15,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:15,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:15,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955662963] [2022-03-01 16:50:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:15,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:15,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:15,161 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:15,814 INFO L93 Difference]: Finished difference Result 10255 states and 20309 transitions. [2022-03-01 16:50:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:50:15,814 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-03-01 16:50:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:15,826 INFO L225 Difference]: With dead ends: 10255 [2022-03-01 16:50:15,827 INFO L226 Difference]: Without dead ends: 10255 [2022-03-01 16:50:15,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-03-01 16:50:15,827 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1018 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:15,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 1835 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2022-03-01 16:50:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 4094. [2022-03-01 16:50:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4080 states have (on average 1.9808823529411765) internal successors, (8082), 4093 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-01 16:50:15,893 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-01 16:50:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:15,894 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-01 16:50:15,894 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-03-01 16:50:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-01 16:50:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:15,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:15,895 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-03-01 16:50:15,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:16,096 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-03-01 16:50:16,096 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -676249591, now seen corresponding path program 33 times [2022-03-01 16:50:16,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:16,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878274240] [2022-03-01 16:50:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:16,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-03-01 16:50:16,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:16,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878274240] [2022-03-01 16:50:16,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878274240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:16,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151017503] [2022-03-01 16:50:16,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:16,196 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-03-01 16:50:16,197 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-03-01 16:50:16,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:16,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:16,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:16,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:16,649 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-03-01 16:50:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:16,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:16,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151017503] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:16,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:16,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-01 16:50:16,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485695925] [2022-03-01 16:50:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:16,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:16,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:50:16,686 INFO L87 Difference]: Start difference. First operand 4094 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:17,866 INFO L93 Difference]: Finished difference Result 11350 states and 22432 transitions. [2022-03-01 16:50:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 16:50:17,867 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-03-01 16:50:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:17,880 INFO L225 Difference]: With dead ends: 11350 [2022-03-01 16:50:17,881 INFO L226 Difference]: Without dead ends: 11350 [2022-03-01 16:50:17,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1195, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:50:17,881 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 1219 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:17,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 2165 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:50:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2022-03-01 16:50:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 4082. [2022-03-01 16:50:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4068 states have (on average 1.980825958702065) internal successors, (8058), 4081 states have internal predecessors, (8058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 8058 transitions. [2022-03-01 16:50:17,981 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 8058 transitions. Word has length 105 [2022-03-01 16:50:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:17,981 INFO L470 AbstractCegarLoop]: Abstraction has 4082 states and 8058 transitions. [2022-03-01 16:50:17,981 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-03-01 16:50:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 8058 transitions. [2022-03-01 16:50:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:17,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:17,983 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-03-01 16:50:18,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:18,183 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-03-01 16:50:18,183 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2113802281, now seen corresponding path program 34 times [2022-03-01 16:50:18,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:18,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408387962] [2022-03-01 16:50:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:18,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:18,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408387962] [2022-03-01 16:50:18,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408387962] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:18,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788656238] [2022-03-01 16:50:18,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:50:18,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:18,274 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-03-01 16:50:18,275 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-03-01 16:50:18,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:50:18,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:18,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-01 16:50:18,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:18,617 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-03-01 16:50:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:18,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:18,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788656238] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:18,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:18,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-01 16:50:18,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310239558] [2022-03-01 16:50:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:18,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 16:50:18,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:18,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 16:50:18,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:50:18,643 INFO L87 Difference]: Start difference. First operand 4082 states and 8058 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:19,576 INFO L93 Difference]: Finished difference Result 15159 states and 30102 transitions. [2022-03-01 16:50:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:50:19,576 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-03-01 16:50:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:19,596 INFO L225 Difference]: With dead ends: 15159 [2022-03-01 16:50:19,596 INFO L226 Difference]: Without dead ends: 15159 [2022-03-01 16:50:19,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:50:19,597 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 1559 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:19,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 2491 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:50:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-03-01 16:50:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 4092. [2022-03-01 16:50:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4078 states have (on average 1.980872976949485) internal successors, (8078), 4091 states have internal predecessors, (8078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 8078 transitions. [2022-03-01 16:50:19,682 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 8078 transitions. Word has length 105 [2022-03-01 16:50:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:19,682 INFO L470 AbstractCegarLoop]: Abstraction has 4092 states and 8078 transitions. [2022-03-01 16:50:19,682 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-03-01 16:50:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 8078 transitions. [2022-03-01 16:50:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:19,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:19,683 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-03-01 16:50:19,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-01 16:50:19,884 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-03-01 16:50:19,884 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1566871339, now seen corresponding path program 35 times [2022-03-01 16:50:19,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:19,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872423503] [2022-03-01 16:50:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:20,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:20,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872423503] [2022-03-01 16:50:20,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872423503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:20,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867746792] [2022-03-01 16:50:20,078 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:50:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:20,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:20,079 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-03-01 16:50:20,080 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-03-01 16:50:20,315 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:50:20,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:20,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:20,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:20,546 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-03-01 16:50:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:20,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:20,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867746792] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:20,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:20,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:20,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822011560] [2022-03-01 16:50:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:20,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:20,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:20,600 INFO L87 Difference]: Start difference. First operand 4092 states and 8078 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:21,276 INFO L93 Difference]: Finished difference Result 12497 states and 24788 transitions. [2022-03-01 16:50:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:50:21,277 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-03-01 16:50:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:21,293 INFO L225 Difference]: With dead ends: 12497 [2022-03-01 16:50:21,293 INFO L226 Difference]: Without dead ends: 12497 [2022-03-01 16:50:21,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2022-03-01 16:50:21,294 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1045 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:21,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 1919 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-03-01 16:50:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 4094. [2022-03-01 16:50:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4080 states have (on average 1.9808823529411765) internal successors, (8082), 4093 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 8082 transitions. [2022-03-01 16:50:21,369 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 8082 transitions. Word has length 105 [2022-03-01 16:50:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:21,369 INFO L470 AbstractCegarLoop]: Abstraction has 4094 states and 8082 transitions. [2022-03-01 16:50:21,369 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-03-01 16:50:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 8082 transitions. [2022-03-01 16:50:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:21,371 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:21,371 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-03-01 16:50:21,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:21,571 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-03-01 16:50:21,571 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:21,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1080388713, now seen corresponding path program 36 times [2022-03-01 16:50:21,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:21,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18042184] [2022-03-01 16:50:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:21,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:21,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18042184] [2022-03-01 16:50:21,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18042184] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:21,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682017979] [2022-03-01 16:50:21,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:50:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:21,765 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-03-01 16:50:21,766 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-03-01 16:50:21,964 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:50:21,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:21,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:21,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:22,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:50:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:22,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:22,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682017979] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:22,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:22,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:22,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418913716] [2022-03-01 16:50:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:22,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:22,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:22,236 INFO L87 Difference]: Start difference. First operand 4094 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:23,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:23,347 INFO L93 Difference]: Finished difference Result 13459 states and 26664 transitions. [2022-03-01 16:50:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:50:23,347 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-03-01 16:50:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:23,365 INFO L225 Difference]: With dead ends: 13459 [2022-03-01 16:50:23,365 INFO L226 Difference]: Without dead ends: 13459 [2022-03-01 16:50:23,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 16:50:23,365 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1335 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:23,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1335 Valid, 2209 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:50:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13459 states. [2022-03-01 16:50:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13459 to 4088. [2022-03-01 16:50:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4074 states have (on average 1.9808541973490428) internal successors, (8070), 4087 states have internal predecessors, (8070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 8070 transitions. [2022-03-01 16:50:23,443 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 8070 transitions. Word has length 105 [2022-03-01 16:50:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:23,444 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 8070 transitions. [2022-03-01 16:50:23,444 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-03-01 16:50:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 8070 transitions. [2022-03-01 16:50:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:23,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:23,445 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-03-01 16:50:23,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-01 16:50:23,645 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-03-01 16:50:23,646 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1274129545, now seen corresponding path program 37 times [2022-03-01 16:50:23,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:23,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539528475] [2022-03-01 16:50:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:23,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:23,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539528475] [2022-03-01 16:50:23,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539528475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:23,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810548543] [2022-03-01 16:50:23,793 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:50:23,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:23,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:23,794 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-03-01 16:50:23,795 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-03-01 16:50:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:24,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:24,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:24,184 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-03-01 16:50:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:24,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:24,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810548543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:24,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:24,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:24,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522431669] [2022-03-01 16:50:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:24,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:24,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:24,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:24,252 INFO L87 Difference]: Start difference. First operand 4088 states and 8070 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:24,684 INFO L93 Difference]: Finished difference Result 8298 states and 16433 transitions. [2022-03-01 16:50:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:50:24,684 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-03-01 16:50:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:24,692 INFO L225 Difference]: With dead ends: 8298 [2022-03-01 16:50:24,693 INFO L226 Difference]: Without dead ends: 8298 [2022-03-01 16:50:24,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:50:24,693 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 656 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:24,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1447 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:50:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2022-03-01 16:50:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4091. [2022-03-01 16:50:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 4077 states have (on average 1.9808682855040471) internal successors, (8076), 4090 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 8076 transitions. [2022-03-01 16:50:24,753 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 8076 transitions. Word has length 105 [2022-03-01 16:50:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:24,753 INFO L470 AbstractCegarLoop]: Abstraction has 4091 states and 8076 transitions. [2022-03-01 16:50:24,754 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-03-01 16:50:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 8076 transitions. [2022-03-01 16:50:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:24,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:24,755 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-03-01 16:50:24,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-01 16:50:24,967 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-03-01 16:50:24,967 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -151065913, now seen corresponding path program 38 times [2022-03-01 16:50:24,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:24,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401861228] [2022-03-01 16:50:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:25,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:25,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401861228] [2022-03-01 16:50:25,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401861228] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:25,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939148983] [2022-03-01 16:50:25,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:50:25,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:25,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:25,154 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-03-01 16:50:25,157 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-03-01 16:50:25,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:50:25,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:25,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:25,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:25,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 13 treesize of output 9 [2022-03-01 16:50:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:25,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:25,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939148983] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:25,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:25,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-01 16:50:25,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586285289] [2022-03-01 16:50:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:25,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:25,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:25,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:25,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:50:25,645 INFO L87 Difference]: Start difference. First operand 4091 states and 8076 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:26,245 INFO L93 Difference]: Finished difference Result 9996 states and 19805 transitions. [2022-03-01 16:50:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:50:26,245 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-03-01 16:50:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:26,256 INFO L225 Difference]: With dead ends: 9996 [2022-03-01 16:50:26,257 INFO L226 Difference]: Without dead ends: 9996 [2022-03-01 16:50:26,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:50:26,258 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 859 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:26,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1586 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:50:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-03-01 16:50:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 4093. [2022-03-01 16:50:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 4079 states have (on average 1.980877666094631) internal successors, (8080), 4092 states have internal predecessors, (8080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 8080 transitions. [2022-03-01 16:50:26,323 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 8080 transitions. Word has length 105 [2022-03-01 16:50:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:26,323 INFO L470 AbstractCegarLoop]: Abstraction has 4093 states and 8080 transitions. [2022-03-01 16:50:26,323 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-03-01 16:50:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 8080 transitions. [2022-03-01 16:50:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 16:50:26,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:26,325 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-03-01 16:50:26,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-01 16:50:26,525 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-03-01 16:50:26,525 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1204375993, now seen corresponding path program 39 times [2022-03-01 16:50:26,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:26,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106848156] [2022-03-01 16:50:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-01 16:50:26,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:26,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106848156] [2022-03-01 16:50:26,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106848156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:26,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708498787] [2022-03-01 16:50:26,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:50:26,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:26,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:26,690 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-03-01 16:50:26,691 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-03-01 16:50:26,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:50:26,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:50:26,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-01 16:50:26,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:27,137 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-03-01 16:50:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:27,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:50:27,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708498787] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:27,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:50:27,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:50:27,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240164100] [2022-03-01 16:50:27,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:27,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:27,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:50:27,171 INFO L87 Difference]: Start difference. First operand 4093 states and 8080 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:28,064 INFO L93 Difference]: Finished difference Result 9499 states and 18787 transitions. [2022-03-01 16:50:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 16:50:28,064 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-03-01 16:50:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:28,075 INFO L225 Difference]: With dead ends: 9499 [2022-03-01 16:50:28,075 INFO L226 Difference]: Without dead ends: 9499 [2022-03-01 16:50:28,075 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-03-01 16:50:28,075 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 1102 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:28,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 1703 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:50:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2022-03-01 16:50:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 4073. [2022-03-01 16:50:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4059 states have (on average 1.9807834441980783) internal successors, (8040), 4072 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 8040 transitions. [2022-03-01 16:50:28,134 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 8040 transitions. Word has length 105 [2022-03-01 16:50:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:28,134 INFO L470 AbstractCegarLoop]: Abstraction has 4073 states and 8040 transitions. [2022-03-01 16:50:28,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 8040 transitions. [2022-03-01 16:50:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-01 16:50:28,135 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:28,135 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, 1, 1, 1, 1, 1] [2022-03-01 16:50:28,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-01 16:50:28,335 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-03-01 16:50:28,336 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1890126863, now seen corresponding path program 1 times [2022-03-01 16:50:28,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:28,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026150912] [2022-03-01 16:50:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:28,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:28,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026150912] [2022-03-01 16:50:28,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026150912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:28,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068582721] [2022-03-01 16:50:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:28,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:28,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:28,370 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-03-01 16:50:28,371 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-03-01 16:50:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:28,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:50:28,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:28,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:28,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068582721] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:50:28,824 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:50:28,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:50:28,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901705629] [2022-03-01 16:50:28,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:50:28,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:50:28,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:50:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:50:28,825 INFO L87 Difference]: Start difference. First operand 4073 states and 8040 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:28,880 INFO L93 Difference]: Finished difference Result 7477 states and 14848 transitions. [2022-03-01 16:50:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:50:28,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-03-01 16:50:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:28,890 INFO L225 Difference]: With dead ends: 7477 [2022-03-01 16:50:28,890 INFO L226 Difference]: Without dead ends: 7477 [2022-03-01 16:50:28,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-01 16:50:28,890 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 496 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:28,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 1111 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:50:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-01 16:50:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7321. [2022-03-01 16:50:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 7307 states have (on average 2.0106746954974684) internal successors, (14692), 7320 states have internal predecessors, (14692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 14692 transitions. [2022-03-01 16:50:28,978 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 14692 transitions. Word has length 110 [2022-03-01 16:50:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:28,978 INFO L470 AbstractCegarLoop]: Abstraction has 7321 states and 14692 transitions. [2022-03-01 16:50:28,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 14692 transitions. [2022-03-01 16:50:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 16:50:28,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:28,979 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-03-01 16:50:28,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-01 16:50:29,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:29,180 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -621139911, now seen corresponding path program 1 times [2022-03-01 16:50:29,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:29,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662284028] [2022-03-01 16:50:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-01 16:50:29,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:29,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662284028] [2022-03-01 16:50:29,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662284028] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:50:29,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:50:29,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:50:29,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311352480] [2022-03-01 16:50:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:50:29,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:50:29,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:50:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:50:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:29,253 INFO L87 Difference]: Start difference. First operand 7321 states and 14692 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:50:29,436 INFO L93 Difference]: Finished difference Result 8193 states and 16446 transitions. [2022-03-01 16:50:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:50:29,437 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-03-01 16:50:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:50:29,450 INFO L225 Difference]: With dead ends: 8193 [2022-03-01 16:50:29,450 INFO L226 Difference]: Without dead ends: 7610 [2022-03-01 16:50:29,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:50:29,451 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 200 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:50:29,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 509 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:50:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-01 16:50:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6942. [2022-03-01 16:50:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6942 states, 6929 states have (on average 2.012122961466301) internal successors, (13942), 6941 states have internal predecessors, (13942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:50:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 13942 transitions. [2022-03-01 16:50:29,535 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 13942 transitions. Word has length 114 [2022-03-01 16:50:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:50:29,535 INFO L470 AbstractCegarLoop]: Abstraction has 6942 states and 13942 transitions. [2022-03-01 16:50:29,535 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-03-01 16:50:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 13942 transitions. [2022-03-01 16:50:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:50:29,538 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:50:29,538 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-03-01 16:50:29,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-01 16:50:29,538 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:50:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:50:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 901308923, now seen corresponding path program 1 times [2022-03-01 16:50:29,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:50:29,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753346254] [2022-03-01 16:50:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:50:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:29,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:50:29,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753346254] [2022-03-01 16:50:29,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753346254] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:50:29,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267856046] [2022-03-01 16:50:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:50:29,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:50:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:50:29,767 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-03-01 16:50:29,767 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-03-01 16:50:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:50:29,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:50:30,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:50:30,408 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-03-01 16:50:30,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,447 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-03-01 16:50:30,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,489 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-03-01 16:50:30,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:50:30,554 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-03-01 16:50:30,892 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:50:30,892 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-03-01 16:50:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:50:30,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:50:31,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) is different from false [2022-03-01 16:50:41,219 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1))))) is different from false [2022-03-01 16:50:58,094 WARN L228 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:51:00,542 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |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 (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| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |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 (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 .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1))))) is different from false [2022-03-01 16:51:03,012 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse1 |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 .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |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 (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|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |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 (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 .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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|) .cse6 |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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1))))) is different from false [2022-03-01 16:51:03,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:03,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 235 trivial. 2 not checked. [2022-03-01 16:51:08,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267856046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:51:08,235 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:51:08,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 16:51:08,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119695662] [2022-03-01 16:51:08,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:51:08,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:51:08,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:51:08,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:51:08,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1079, Unknown=11, NotChecked=284, Total=1560 [2022-03-01 16:51:08,237 INFO L87 Difference]: Start difference. First operand 6942 states and 13942 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:51:12,763 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (* (- 1) |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse3) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse3) 28)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (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|) .cse6 |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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse7 (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 .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-01 16:51:15,029 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (= |c_~#cache~0.base| 1) (= |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 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_4746 Int)) (or (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 1)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |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-03-01 16:51:17,610 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |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_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |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-03-01 16:51:19,672 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_4746 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_4746)) |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| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |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_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-01 16:51:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:51:26,907 INFO L93 Difference]: Finished difference Result 19002 states and 38180 transitions. [2022-03-01 16:51:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 16:51:26,907 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:51:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:51:26,940 INFO L225 Difference]: With dead ends: 19002 [2022-03-01 16:51:26,940 INFO L226 Difference]: Without dead ends: 19002 [2022-03-01 16:51:26,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=472, Invalid=2625, Unknown=15, NotChecked=920, Total=4032 [2022-03-01 16:51:26,941 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 1823 mSDsluCounter, 5804 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 6315 SdHoareTripleChecker+Invalid, 7126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4136 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:51:26,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1823 Valid, 6315 Invalid, 7126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2945 Invalid, 0 Unknown, 4136 Unchecked, 8.4s Time] [2022-03-01 16:51:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19002 states. [2022-03-01 16:51:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19002 to 6994. [2022-03-01 16:51:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6994 states, 6981 states have (on average 2.012032660077353) internal successors, (14046), 6993 states have internal predecessors, (14046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 14046 transitions. [2022-03-01 16:51:27,093 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 14046 transitions. Word has length 134 [2022-03-01 16:51:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:51:27,094 INFO L470 AbstractCegarLoop]: Abstraction has 6994 states and 14046 transitions. [2022-03-01 16:51:27,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:51:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 14046 transitions. [2022-03-01 16:51:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:51:27,097 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:51:27,097 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-03-01 16:51:27,125 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-03-01 16:51:27,297 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-03-01 16:51:27,298 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:51:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:51:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2095982239, now seen corresponding path program 2 times [2022-03-01 16:51:27,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:51:27,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381168149] [2022-03-01 16:51:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:51:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:51:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:28,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:51:28,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381168149] [2022-03-01 16:51:28,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381168149] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:28,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496298524] [2022-03-01 16:51:28,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:51:28,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:51:28,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:51:28,349 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-03-01 16:51:28,349 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-03-01 16:51:28,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:51:28,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:51:28,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:51:28,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:51:29,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:51:29,880 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-03-01 16:51:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,051 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-03-01 16:51:30,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,219 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-03-01 16:51:30,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:30,668 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-03-01 16:51:31,589 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:51:31,589 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-03-01 16:51:31,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:31,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:51:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:51:32,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:51:34,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:34,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:35,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:35,662 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 18 treesize of output 12 [2022-03-01 16:51:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:51:36,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496298524] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:36,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:51:36,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:51:36,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309830921] [2022-03-01 16:51:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:51:36,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:51:36,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:51:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:51:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:51:36,275 INFO L87 Difference]: Start difference. First operand 6994 states and 14046 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:51:38,135 INFO L93 Difference]: Finished difference Result 9101 states and 18259 transitions. [2022-03-01 16:51:38,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:51:38,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:51:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:51:38,147 INFO L225 Difference]: With dead ends: 9101 [2022-03-01 16:51:38,148 INFO L226 Difference]: Without dead ends: 9101 [2022-03-01 16:51:38,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:51:38,148 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 268 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:51:38,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 2153 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 553 Unchecked, 0.6s Time] [2022-03-01 16:51:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2022-03-01 16:51:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 7016. [2022-03-01 16:51:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 7003 states have (on average 2.0119948593459944) internal successors, (14090), 7015 states have internal predecessors, (14090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 14090 transitions. [2022-03-01 16:51:38,239 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 14090 transitions. Word has length 134 [2022-03-01 16:51:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:51:38,239 INFO L470 AbstractCegarLoop]: Abstraction has 7016 states and 14090 transitions. [2022-03-01 16:51:38,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 14090 transitions. [2022-03-01 16:51:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:51:38,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:51:38,242 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-03-01 16:51:38,262 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-03-01 16:51:38,448 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-03-01 16:51:38,448 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:51:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:51:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash 658342497, now seen corresponding path program 3 times [2022-03-01 16:51:38,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:51:38,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17304807] [2022-03-01 16:51:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:51:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:51:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:39,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:51:39,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17304807] [2022-03-01 16:51:39,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17304807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:39,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709862182] [2022-03-01 16:51:39,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:51:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:51:39,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:51:39,480 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-03-01 16:51:39,481 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-03-01 16:51:39,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:51:39,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:51:39,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:51:39,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:51:40,601 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-03-01 16:51:41,004 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-03-01 16:51:41,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,158 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-03-01 16:51:41,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,326 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-03-01 16:51:41,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:41,794 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-03-01 16:51:42,594 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:51:42,595 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-03-01 16:51:42,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:42,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, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:51:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:51:43,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:51:45,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:45,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:51:46,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:46,515 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 18 treesize of output 12 [2022-03-01 16:51:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:51:47,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709862182] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:47,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:51:47,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:51:47,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805112720] [2022-03-01 16:51:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:51:47,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:51:47,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:51:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:51:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:51:47,173 INFO L87 Difference]: Start difference. First operand 7016 states and 14090 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:51:49,925 INFO L93 Difference]: Finished difference Result 9179 states and 18430 transitions. [2022-03-01 16:51:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:51:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:51:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:51:49,936 INFO L225 Difference]: With dead ends: 9179 [2022-03-01 16:51:49,936 INFO L226 Difference]: Without dead ends: 9179 [2022-03-01 16:51:49,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 16:51:49,937 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 292 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 760 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:51:49,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1931 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 760 Unchecked, 0.7s Time] [2022-03-01 16:51:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9179 states. [2022-03-01 16:51:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9179 to 7020. [2022-03-01 16:51:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7020 states, 7007 states have (on average 2.011988011988012) internal successors, (14098), 7019 states have internal predecessors, (14098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7020 states to 7020 states and 14098 transitions. [2022-03-01 16:51:50,028 INFO L78 Accepts]: Start accepts. Automaton has 7020 states and 14098 transitions. Word has length 134 [2022-03-01 16:51:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:51:50,029 INFO L470 AbstractCegarLoop]: Abstraction has 7020 states and 14098 transitions. [2022-03-01 16:51:50,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:51:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7020 states and 14098 transitions. [2022-03-01 16:51:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:51:50,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:51:50,031 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-03-01 16:51:50,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-01 16:51:50,235 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-03-01 16:51:50,235 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:51:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:51:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -339667099, now seen corresponding path program 4 times [2022-03-01 16:51:50,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:51:50,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649783550] [2022-03-01 16:51:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:51:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:51:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:51:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:51,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:51:51,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649783550] [2022-03-01 16:51:51,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649783550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:51:51,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027681678] [2022-03-01 16:51:51,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:51:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:51:51,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:51:51,308 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-03-01 16:51:51,308 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-03-01 16:51:51,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:51:51,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:51:51,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-01 16:51:51,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:51:52,190 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-03-01 16:51:52,500 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-03-01 16:51:52,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:52,616 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-03-01 16:51:52,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:52,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:52,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:52,777 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-03-01 16:51:53,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,374 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-03-01 16:51:53,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:51:53,777 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-03-01 16:51:54,111 INFO L353 Elim1Store]: treesize reduction 212, result has 14.2 percent of original size [2022-03-01 16:51:54,111 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 54 treesize of output 62 [2022-03-01 16:51:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:51:54,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:04,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:04,586 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-03-01 16:52:04,606 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 16:52:04,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:04,614 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-01 16:52:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:05,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027681678] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:52:05,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:52:05,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 38 [2022-03-01 16:52:05,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533795749] [2022-03-01 16:52:05,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:52:05,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-01 16:52:05,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-01 16:52:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1290, Unknown=1, NotChecked=0, Total=1482 [2022-03-01 16:52:05,404 INFO L87 Difference]: Start difference. First operand 7020 states and 14098 transitions. Second operand has 39 states, 38 states have (on average 5.394736842105263) internal successors, (205), 39 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:26,773 INFO L93 Difference]: Finished difference Result 10454 states and 20740 transitions. [2022-03-01 16:52:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 16:52:26,773 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 5.394736842105263) internal successors, (205), 39 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-01 16:52:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:26,785 INFO L225 Difference]: With dead ends: 10454 [2022-03-01 16:52:26,786 INFO L226 Difference]: Without dead ends: 10454 [2022-03-01 16:52:26,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=812, Invalid=4295, Unknown=5, NotChecked=0, Total=5112 [2022-03-01 16:52:26,786 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 1769 mSDsluCounter, 8979 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 9619 SdHoareTripleChecker+Invalid, 5918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3262 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:26,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 9619 Invalid, 5918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2501 Invalid, 0 Unknown, 3262 Unchecked, 7.1s Time] [2022-03-01 16:52:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10454 states. [2022-03-01 16:52:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10454 to 6994. [2022-03-01 16:52:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6994 states, 6981 states have (on average 2.012032660077353) internal successors, (14046), 6993 states have internal predecessors, (14046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 14046 transitions. [2022-03-01 16:52:26,868 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 14046 transitions. Word has length 134 [2022-03-01 16:52:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:26,868 INFO L470 AbstractCegarLoop]: Abstraction has 6994 states and 14046 transitions. [2022-03-01 16:52:26,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 5.394736842105263) internal successors, (205), 39 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 14046 transitions. [2022-03-01 16:52:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:26,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:26,871 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-03-01 16:52:26,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-01 16:52:27,071 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-03-01 16:52:27,071 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:52:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash -423512185, now seen corresponding path program 5 times [2022-03-01 16:52:27,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:27,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096158807] [2022-03-01 16:52:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:28,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:28,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096158807] [2022-03-01 16:52:28,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096158807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:28,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033309188] [2022-03-01 16:52:28,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:52:28,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:28,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:28,182 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-03-01 16:52:28,182 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-03-01 16:52:28,521 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:52:28,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:28,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:52:28,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:30,991 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-03-01 16:52:31,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:31,139 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-03-01 16:52:31,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:31,334 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-03-01 16:52:32,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,305 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-03-01 16:52:32,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:32,780 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-03-01 16:52:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:32,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:36,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:36,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:37,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033309188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:52:37,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:52:37,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:52:37,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611861485] [2022-03-01 16:52:37,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:52:37,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:52:37,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:37,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:52:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:52:37,850 INFO L87 Difference]: Start difference. First operand 6994 states and 14046 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:52:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:49,550 INFO L93 Difference]: Finished difference Result 7997 states and 15973 transitions. [2022-03-01 16:52:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:52:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:52:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:49,560 INFO L225 Difference]: With dead ends: 7997 [2022-03-01 16:52:49,578 INFO L226 Difference]: Without dead ends: 7997 [2022-03-01 16:52:49,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=616, Invalid=2806, Unknown=0, NotChecked=0, Total=3422 [2022-03-01 16:52:49,578 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 1438 mSDsluCounter, 7058 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 7524 SdHoareTripleChecker+Invalid, 4697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1578 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:49,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1438 Valid, 7524 Invalid, 4697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3025 Invalid, 0 Unknown, 1578 Unchecked, 8.8s Time] [2022-03-01 16:52:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2022-03-01 16:52:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 7040. [2022-03-01 16:52:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7040 states, 7027 states have (on average 2.0122385086096486) internal successors, (14140), 7039 states have internal predecessors, (14140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7040 states to 7040 states and 14140 transitions. [2022-03-01 16:52:49,644 INFO L78 Accepts]: Start accepts. Automaton has 7040 states and 14140 transitions. Word has length 134 [2022-03-01 16:52:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:49,645 INFO L470 AbstractCegarLoop]: Abstraction has 7040 states and 14140 transitions. [2022-03-01 16:52:49,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:52:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7040 states and 14140 transitions. [2022-03-01 16:52:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:52:49,647 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:49,647 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-03-01 16:52:49,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-01 16:52:49,851 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-03-01 16:52:49,852 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:52:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -893918699, now seen corresponding path program 6 times [2022-03-01 16:52:49,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:49,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527425687] [2022-03-01 16:52:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:52:50,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:50,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527425687] [2022-03-01 16:52:50,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527425687] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:50,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046819157] [2022-03-01 16:52:50,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:52:50,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:50,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:50,940 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-03-01 16:52:50,943 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-03-01 16:52:51,190 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:52:51,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:51,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:52:51,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:52,092 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-03-01 16:52:52,492 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-03-01 16:52:52,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:52,644 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-03-01 16:52:53,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,115 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-03-01 16:52:53,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:53,349 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-03-01 16:52:54,056 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:52:54,056 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-03-01 16:52:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:54,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:52:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:52:54,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:57,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:57,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:52:58,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:58,064 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 18 treesize of output 12 [2022-03-01 16:52:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:52:58,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046819157] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:58,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:52:58,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:52:58,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946077295] [2022-03-01 16:52:58,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:58,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:52:58,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:52:58,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:52:58,666 INFO L87 Difference]: Start difference. First operand 7040 states and 14140 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:01,380 INFO L93 Difference]: Finished difference Result 9152 states and 18385 transitions. [2022-03-01 16:53:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:53:01,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:53:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:01,391 INFO L225 Difference]: With dead ends: 9152 [2022-03-01 16:53:01,391 INFO L226 Difference]: Without dead ends: 9152 [2022-03-01 16:53:01,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 16:53:01,392 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 281 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:01,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 2269 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 1087 Unchecked, 0.8s Time] [2022-03-01 16:53:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9152 states. [2022-03-01 16:53:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9152 to 7068. [2022-03-01 16:53:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7068 states, 7055 states have (on average 2.01218993621545) internal successors, (14196), 7067 states have internal predecessors, (14196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7068 states to 7068 states and 14196 transitions. [2022-03-01 16:53:01,467 INFO L78 Accepts]: Start accepts. Automaton has 7068 states and 14196 transitions. Word has length 134 [2022-03-01 16:53:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:01,468 INFO L470 AbstractCegarLoop]: Abstraction has 7068 states and 14196 transitions. [2022-03-01 16:53:01,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7068 states and 14196 transitions. [2022-03-01 16:53:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:53:01,470 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:01,470 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-03-01 16:53:01,488 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-03-01 16:53:01,671 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-03-01 16:53:01,671 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:53:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1859931871, now seen corresponding path program 7 times [2022-03-01 16:53:01,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:01,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841212242] [2022-03-01 16:53:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:02,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:02,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841212242] [2022-03-01 16:53:02,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841212242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:02,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606897679] [2022-03-01 16:53:02,797 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:53:02,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:02,798 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-03-01 16:53:02,799 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-03-01 16:53:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:03,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:53:03,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:04,593 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-03-01 16:53:04,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:04,735 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-03-01 16:53:05,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,144 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-03-01 16:53:05,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:53:05,544 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-03-01 16:53:06,182 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:53:06,182 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-03-01 16:53:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:53:06,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:45,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (and (forall ((v_ArrVal_5666 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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5666 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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |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|)) (forall ((v_ArrVal_5666 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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5666 Int)) (= (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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|))) is different from false [2022-03-01 16:54:20,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_31| 0)) (and (forall ((v_ArrVal_5666 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 (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 .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (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|) .cse2 |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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5666 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 (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|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5666 Int)) (= (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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2022-03-01 16:54:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-01 16:54:25,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606897679] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:54:25,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:54:25,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 16:54:25,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079724258] [2022-03-01 16:54:25,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:54:25,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:54:25,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:25,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:54:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1215, Unknown=27, NotChecked=146, Total=1560 [2022-03-01 16:54:25,975 INFO L87 Difference]: Start difference. First operand 7068 states and 14196 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:54:30,099 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* (- 1) |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_31| 0)) (and (forall ((v_ArrVal_5666 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 (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 .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5666 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (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|) .cse2 |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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5666 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 (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|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5666 Int)) (= (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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse7) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |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|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse7) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-01 16:54:32,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (or (and (forall ((v_ArrVal_5666 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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5666 Int)) (= (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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |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|)) (forall ((v_ArrVal_5666 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5666 Int)) (= (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_5666))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |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-03-01 16:54:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:40,880 INFO L93 Difference]: Finished difference Result 18982 states and 38189 transitions. [2022-03-01 16:54:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-01 16:54:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:54:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:40,907 INFO L225 Difference]: With dead ends: 18982 [2022-03-01 16:54:40,907 INFO L226 Difference]: Without dead ends: 18982 [2022-03-01 16:54:40,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 87.1s TimeCoverageRelationStatistics Valid=710, Invalid=3833, Unknown=29, NotChecked=540, Total=5112 [2022-03-01 16:54:40,908 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 1965 mSDsluCounter, 5690 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 6138 SdHoareTripleChecker+Invalid, 5555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2988 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:40,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1965 Valid, 6138 Invalid, 5555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 2404 Invalid, 0 Unknown, 2988 Unchecked, 6.7s Time] [2022-03-01 16:54:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18982 states. [2022-03-01 16:54:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18982 to 7088. [2022-03-01 16:54:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 7075 states have (on average 2.012155477031802) internal successors, (14236), 7087 states have internal predecessors, (14236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 14236 transitions. [2022-03-01 16:54:41,056 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 14236 transitions. Word has length 134 [2022-03-01 16:54:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:41,056 INFO L470 AbstractCegarLoop]: Abstraction has 7088 states and 14236 transitions. [2022-03-01 16:54:41,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:54:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 14236 transitions. [2022-03-01 16:54:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:54:41,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:41,059 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-03-01 16:54:41,078 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-03-01 16:54:41,260 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-03-01 16:54:41,261 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:54:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1776086785, now seen corresponding path program 8 times [2022-03-01 16:54:41,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:41,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333205675] [2022-03-01 16:54:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:54:42,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:42,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333205675] [2022-03-01 16:54:42,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333205675] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:54:42,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304938321] [2022-03-01 16:54:42,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:54:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:54:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:54:42,333 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-03-01 16:54:42,334 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-03-01 16:54:42,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:54:42,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:54:42,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:54:42,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:54:43,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:54:43,880 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-03-01 16:54:44,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:44,048 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-03-01 16:54:44,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:44,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:44,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:44,512 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-03-01 16:54:45,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,137 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-03-01 16:54:45,412 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:54:45,413 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-03-01 16:54:45,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:45,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:54:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:54:45,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:54:48,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:48,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:54:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:49,590 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 18 treesize of output 12 [2022-03-01 16:54:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:54:50,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304938321] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:54:50,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:54:50,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:54:50,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820581053] [2022-03-01 16:54:50,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:50,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:54:50,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:50,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:54:50,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:54:50,233 INFO L87 Difference]: Start difference. First operand 7088 states and 14236 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:52,721 INFO L93 Difference]: Finished difference Result 9152 states and 18382 transitions. [2022-03-01 16:54:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:54:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:54:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:52,732 INFO L225 Difference]: With dead ends: 9152 [2022-03-01 16:54:52,733 INFO L226 Difference]: Without dead ends: 9152 [2022-03-01 16:54:52,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 16:54:52,733 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 286 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:52,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 1707 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 392 Unchecked, 0.7s Time] [2022-03-01 16:54:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9152 states. [2022-03-01 16:54:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9152 to 7094. [2022-03-01 16:54:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7094 states, 7081 states have (on average 2.0121451772348538) internal successors, (14248), 7093 states have internal predecessors, (14248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7094 states to 7094 states and 14248 transitions. [2022-03-01 16:54:52,809 INFO L78 Accepts]: Start accepts. Automaton has 7094 states and 14248 transitions. Word has length 134 [2022-03-01 16:54:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:52,809 INFO L470 AbstractCegarLoop]: Abstraction has 7094 states and 14248 transitions. [2022-03-01 16:54:52,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 14248 transitions. [2022-03-01 16:54:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:54:52,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:52,812 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-03-01 16:54:52,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-03-01 16:54:53,012 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-03-01 16:54:53,012 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:54:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1853945391, now seen corresponding path program 9 times [2022-03-01 16:54:53,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:53,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238795698] [2022-03-01 16:54:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:54:54,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:54,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238795698] [2022-03-01 16:54:54,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238795698] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:54:54,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908833779] [2022-03-01 16:54:54,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:54:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:54:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:54:54,153 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-03-01 16:54:54,154 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-03-01 16:54:54,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:54:54,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:54:54,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:54:54,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:54:55,343 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-03-01 16:54:55,777 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-03-01 16:54:55,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:55,937 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-03-01 16:54:56,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:56,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:56,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:56,379 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-03-01 16:54:57,025 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:54:57,025 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-03-01 16:54:57,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-03-01 16:54:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:54:57,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:54:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:54:57,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:00,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:00,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:01,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:01,609 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 18 treesize of output 12 [2022-03-01 16:55:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:55:02,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908833779] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:02,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:55:02,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:55:02,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568159927] [2022-03-01 16:55:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:02,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:55:02,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:55:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:55:02,312 INFO L87 Difference]: Start difference. First operand 7094 states and 14248 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:04,397 INFO L93 Difference]: Finished difference Result 8733 states and 17546 transitions. [2022-03-01 16:55:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:55:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:55:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:04,412 INFO L225 Difference]: With dead ends: 8733 [2022-03-01 16:55:04,412 INFO L226 Difference]: Without dead ends: 8733 [2022-03-01 16:55:04,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 16:55:04,412 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 237 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 769 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:04,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1790 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 769 Unchecked, 0.4s Time] [2022-03-01 16:55:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2022-03-01 16:55:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 7098. [2022-03-01 16:55:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7098 states, 7085 states have (on average 2.0121383203952012) internal successors, (14256), 7097 states have internal predecessors, (14256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7098 states to 7098 states and 14256 transitions. [2022-03-01 16:55:04,491 INFO L78 Accepts]: Start accepts. Automaton has 7098 states and 14256 transitions. Word has length 134 [2022-03-01 16:55:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:04,491 INFO L470 AbstractCegarLoop]: Abstraction has 7098 states and 14256 transitions. [2022-03-01 16:55:04,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 7098 states and 14256 transitions. [2022-03-01 16:55:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:04,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:04,494 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-03-01 16:55:04,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-01 16:55:04,701 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-03-01 16:55:04,701 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:55:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1830852561, now seen corresponding path program 10 times [2022-03-01 16:55:04,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:04,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429560929] [2022-03-01 16:55:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:04,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:05,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:05,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429560929] [2022-03-01 16:55:05,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429560929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:05,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650863642] [2022-03-01 16:55:05,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:55:05,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:05,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:05,790 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-03-01 16:55:05,790 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-03-01 16:55:06,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:55:06,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:06,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:55:06,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:07,846 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-03-01 16:55:07,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:07,987 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-03-01 16:55:08,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:08,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:08,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:08,412 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-03-01 16:55:09,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,145 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-03-01 16:55:09,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:09,392 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:55:09,392 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-03-01 16:55:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:09,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:12,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:12,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:14,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650863642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:55:14,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:55:14,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:55:14,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760521466] [2022-03-01 16:55:14,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:55:14,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:55:14,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:55:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:55:14,386 INFO L87 Difference]: Start difference. First operand 7098 states and 14256 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:55:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:22,497 INFO L93 Difference]: Finished difference Result 8258 states and 16500 transitions. [2022-03-01 16:55:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:55:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:55:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:22,506 INFO L225 Difference]: With dead ends: 8258 [2022-03-01 16:55:22,506 INFO L226 Difference]: Without dead ends: 8258 [2022-03-01 16:55:22,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=689, Invalid=2971, Unknown=0, NotChecked=0, Total=3660 [2022-03-01 16:55:22,507 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 1801 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 5142 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1117 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:22,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1801 Valid, 5142 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1646 Invalid, 0 Unknown, 1117 Unchecked, 4.9s Time] [2022-03-01 16:55:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2022-03-01 16:55:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 7112. [2022-03-01 16:55:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7112 states, 7099 states have (on average 2.0123961121284686) internal successors, (14286), 7111 states have internal predecessors, (14286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 14286 transitions. [2022-03-01 16:55:22,582 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 14286 transitions. Word has length 134 [2022-03-01 16:55:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:22,582 INFO L470 AbstractCegarLoop]: Abstraction has 7112 states and 14286 transitions. [2022-03-01 16:55:22,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:55:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 14286 transitions. [2022-03-01 16:55:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:22,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:22,584 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-03-01 16:55:22,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-03-01 16:55:22,785 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-03-01 16:55:22,785 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:55:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash 802601147, now seen corresponding path program 11 times [2022-03-01 16:55:22,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:22,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414971528] [2022-03-01 16:55:22,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:23,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:23,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414971528] [2022-03-01 16:55:23,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414971528] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:23,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680991410] [2022-03-01 16:55:23,786 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:55:23,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:23,787 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-03-01 16:55:23,787 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-03-01 16:55:24,169 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:55:24,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:24,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:55:24,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:26,921 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-03-01 16:55:27,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:27,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-03-01 16:55:27,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:27,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:27,926 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-03-01 16:55:28,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,169 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-03-01 16:55:28,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:28,962 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-03-01 16:55:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:29,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:32,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:32,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:33,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680991410] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:55:33,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:55:33,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 16:55:33,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451676892] [2022-03-01 16:55:33,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:55:33,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 16:55:33,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:33,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 16:55:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:55:33,744 INFO L87 Difference]: Start difference. First operand 7112 states and 14286 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:55:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:42,360 INFO L93 Difference]: Finished difference Result 7877 states and 15735 transitions. [2022-03-01 16:55:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:55:42,360 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:55:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:42,371 INFO L225 Difference]: With dead ends: 7877 [2022-03-01 16:55:42,371 INFO L226 Difference]: Without dead ends: 7877 [2022-03-01 16:55:42,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=575, Invalid=2617, Unknown=0, NotChecked=0, Total=3192 [2022-03-01 16:55:42,372 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 1248 mSDsluCounter, 5111 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 981 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:42,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1248 Valid, 5536 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2031 Invalid, 0 Unknown, 981 Unchecked, 6.0s Time] [2022-03-01 16:55:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2022-03-01 16:55:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 7120. [2022-03-01 16:55:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7120 states, 7107 states have (on average 2.0123821584353454) internal successors, (14302), 7119 states have internal predecessors, (14302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 14302 transitions. [2022-03-01 16:55:42,447 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 14302 transitions. Word has length 134 [2022-03-01 16:55:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:42,447 INFO L470 AbstractCegarLoop]: Abstraction has 7120 states and 14302 transitions. [2022-03-01 16:55:42,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 16:55:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 14302 transitions. [2022-03-01 16:55:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:42,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:42,449 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-03-01 16:55:42,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-01 16:55:42,663 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-03-01 16:55:42,663 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:55:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash 718756061, now seen corresponding path program 12 times [2022-03-01 16:55:42,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:42,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845712266] [2022-03-01 16:55:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:43,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:43,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845712266] [2022-03-01 16:55:43,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845712266] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:43,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766611999] [2022-03-01 16:55:43,739 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:55:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:43,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:43,740 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:55:43,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-01 16:55:44,018 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:55:44,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:44,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:55:44,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:44,936 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-03-01 16:55:45,345 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-03-01 16:55:45,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:45,534 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-03-01 16:55:46,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,174 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-03-01 16:55:46,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:46,597 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-03-01 16:55:46,868 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:55:46,869 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-03-01 16:55:47,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:47,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:55:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:55:47,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:50,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:50,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:55:51,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:51,180 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 18 treesize of output 12 [2022-03-01 16:55:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:55:51,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766611999] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:51,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:55:51,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:55:51,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043643971] [2022-03-01 16:55:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:51,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:55:51,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:55:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:55:51,818 INFO L87 Difference]: Start difference. First operand 7120 states and 14302 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:53,664 INFO L93 Difference]: Finished difference Result 9104 states and 18267 transitions. [2022-03-01 16:55:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:55:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:55:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:53,676 INFO L225 Difference]: With dead ends: 9104 [2022-03-01 16:55:53,676 INFO L226 Difference]: Without dead ends: 9104 [2022-03-01 16:55:53,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:55:53,676 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 223 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 484 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:53,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 1827 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 484 Unchecked, 0.6s Time] [2022-03-01 16:55:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2022-03-01 16:55:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 7132. [2022-03-01 16:55:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7132 states, 7119 states have (on average 2.01236128669757) internal successors, (14326), 7131 states have internal predecessors, (14326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7132 states to 7132 states and 14326 transitions. [2022-03-01 16:55:53,773 INFO L78 Accepts]: Start accepts. Automaton has 7132 states and 14326 transitions. Word has length 134 [2022-03-01 16:55:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:53,773 INFO L470 AbstractCegarLoop]: Abstraction has 7132 states and 14326 transitions. [2022-03-01 16:55:53,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7132 states and 14326 transitions. [2022-03-01 16:55:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:55:53,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:53,775 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-03-01 16:55:53,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-01 16:55:53,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-03-01 16:55:53,976 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:55:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1383691181, now seen corresponding path program 13 times [2022-03-01 16:55:53,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:53,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429608415] [2022-03-01 16:55:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:55,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:55,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429608415] [2022-03-01 16:55:55,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429608415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:55,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272301757] [2022-03-01 16:55:55,027 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:55:55,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:55,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:55,028 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:55:55,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-01 16:55:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:55,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:55:55,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:56,918 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-03-01 16:55:57,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:57,069 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-03-01 16:55:57,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:57,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:57,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:57,659 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-03-01 16:55:58,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:58,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:58,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:58,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:58,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:55:58,099 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-03-01 16:55:58,493 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:55:58,493 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-03-01 16:55:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:55:58,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:56:30,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 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 (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|) .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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6585 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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-01 16:56:32,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (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_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) is different from false [2022-03-01 16:56:35,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (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_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_40| 0)))) is different from false [2022-03-01 16:56:37,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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 (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 .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (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|) .cse2 |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_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_6585 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 (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|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))) (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_40| 0)))) is different from false [2022-03-01 16:56:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 235 trivial. 2 not checked. [2022-03-01 16:56:38,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272301757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:56:38,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:56:38,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 16:56:38,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413569752] [2022-03-01 16:56:38,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:56:38,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:56:38,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:38,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:56:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1114, Unknown=13, NotChecked=284, Total=1560 [2022-03-01 16:56:38,563 INFO L87 Difference]: Start difference. First operand 7132 states and 14326 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:56:47,411 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| .cse0) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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 (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 .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 Int)) (= (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 (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|) .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_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_6585 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 (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|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_6585 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse6 (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|) .cse7 |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 .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7))))) (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_40| 0)))) (= |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|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-01 16:56:49,486 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (= |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 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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 (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|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 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 (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 .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (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|) .cse6 |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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) (not (<= |v_t_funThread1of1ForFork0_~i~0#1_40| 0)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-01 16:56:51,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (and (forall ((v_ArrVal_6585 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 (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|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_6585 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_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 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 (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 .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (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|) .cse6 |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_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= (+ 28 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-03-01 16:56:53,877 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_68| Int)) (or (and (forall ((v_ArrVal_6585 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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_6585 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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_6585 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 (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|) .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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_6585 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_68| v_ArrVal_6585))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (<= 1 (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 28)) (= |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|)))) is different from false [2022-03-01 16:56:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:58,407 INFO L93 Difference]: Finished difference Result 12232 states and 24492 transitions. [2022-03-01 16:56:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:56:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:56:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:58,423 INFO L225 Difference]: With dead ends: 12232 [2022-03-01 16:56:58,423 INFO L226 Difference]: Without dead ends: 12232 [2022-03-01 16:56:58,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=278, Invalid=1991, Unknown=19, NotChecked=792, Total=3080 [2022-03-01 16:56:58,424 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 1129 mSDsluCounter, 4576 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 4930 SdHoareTripleChecker+Invalid, 6794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4520 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:58,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 4930 Invalid, 6794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2229 Invalid, 0 Unknown, 4520 Unchecked, 6.4s Time] [2022-03-01 16:56:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12232 states. [2022-03-01 16:56:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12232 to 7144. [2022-03-01 16:56:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 7131 states have (on average 2.012340485205441) internal successors, (14350), 7143 states have internal predecessors, (14350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 14350 transitions. [2022-03-01 16:56:58,562 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 14350 transitions. Word has length 134 [2022-03-01 16:56:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:58,562 INFO L470 AbstractCegarLoop]: Abstraction has 7144 states and 14350 transitions. [2022-03-01 16:56:58,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 16:56:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 14350 transitions. [2022-03-01 16:56:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:56:58,565 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:58,565 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-03-01 16:56:58,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-01 16:56:58,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:58,765 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:56:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 708812915, now seen corresponding path program 14 times [2022-03-01 16:56:58,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:58,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830494120] [2022-03-01 16:56:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:56:59,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:59,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830494120] [2022-03-01 16:56:59,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830494120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:59,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615837266] [2022-03-01 16:56:59,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:56:59,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:59,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:59,876 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:59,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-01 16:57:00,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:57:00,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:57:00,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:57:00,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:57:01,096 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-03-01 16:57:01,494 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-03-01 16:57:01,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:01,660 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-03-01 16:57:02,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:02,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:02,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:02,374 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-03-01 16:57:02,798 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:57:02,798 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-03-01 16:57:03,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-03-01 16:57:03,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:03,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:57:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:57:03,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:57:06,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:06,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:07,494 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 18 treesize of output 12 [2022-03-01 16:57:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:57:08,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615837266] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:08,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:57:08,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:57:08,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878506090] [2022-03-01 16:57:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:57:08,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:57:08,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:57:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:57:08,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:57:08,158 INFO L87 Difference]: Start difference. First operand 7144 states and 14350 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:57:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:57:10,811 INFO L93 Difference]: Finished difference Result 9157 states and 18395 transitions. [2022-03-01 16:57:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:57:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:57:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:57:10,821 INFO L225 Difference]: With dead ends: 9157 [2022-03-01 16:57:10,821 INFO L226 Difference]: Without dead ends: 9157 [2022-03-01 16:57:10,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=200, Invalid=1692, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 16:57:10,822 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 262 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 989 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:57:10,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 1861 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 989 Unchecked, 0.8s Time] [2022-03-01 16:57:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2022-03-01 16:57:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 7150. [2022-03-01 16:57:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7137 states have (on average 2.0123301106907663) internal successors, (14362), 7149 states have internal predecessors, (14362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:57:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 14362 transitions. [2022-03-01 16:57:10,898 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 14362 transitions. Word has length 134 [2022-03-01 16:57:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:57:10,898 INFO L470 AbstractCegarLoop]: Abstraction has 7150 states and 14362 transitions. [2022-03-01 16:57:10,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:57:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 14362 transitions. [2022-03-01 16:57:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:57:10,901 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:57:10,901 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-03-01 16:57:10,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-03-01 16:57:11,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:57:11,101 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:57:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:57:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash 731930855, now seen corresponding path program 15 times [2022-03-01 16:57:11,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:57:11,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703445839] [2022-03-01 16:57:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:57:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:57:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:57:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:57:12,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:57:12,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703445839] [2022-03-01 16:57:12,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703445839] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:12,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000824008] [2022-03-01 16:57:12,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:57:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:57:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:57:12,124 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:57:12,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-01 16:57:12,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:57:12,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:57:12,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:57:12,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:57:13,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:57:13,784 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-03-01 16:57:13,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:13,930 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-03-01 16:57:14,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:14,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:14,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:14,621 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-03-01 16:57:15,028 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:57:15,029 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-03-01 16:57:15,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:15,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:15,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:15,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:15,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:15,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:15,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-03-01 16:57:15,550 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-01 16:57:15,550 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-03-01 16:57:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:57:15,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:57:17,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:17,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:17,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:17,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:57:18,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:18,530 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 18 treesize of output 12 [2022-03-01 16:57:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:57:19,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000824008] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:19,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:57:19,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 37 [2022-03-01 16:57:19,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066285813] [2022-03-01 16:57:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:57:19,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:57:19,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:57:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:57:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:57:19,102 INFO L87 Difference]: Start difference. First operand 7150 states and 14362 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:57:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:57:21,458 INFO L93 Difference]: Finished difference Result 9209 states and 18498 transitions. [2022-03-01 16:57:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:57:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:57:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:57:21,472 INFO L225 Difference]: With dead ends: 9209 [2022-03-01 16:57:21,473 INFO L226 Difference]: Without dead ends: 9209 [2022-03-01 16:57:21,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=193, Invalid=1613, Unknown=0, NotChecked=0, Total=1806 [2022-03-01 16:57:21,473 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 282 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:57:21,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 1942 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 345 Invalid, 0 Unknown, 512 Unchecked, 1.0s Time] [2022-03-01 16:57:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9209 states. [2022-03-01 16:57:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9209 to 7152. [2022-03-01 16:57:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7152 states, 7139 states have (on average 2.012326656394453) internal successors, (14366), 7151 states have internal predecessors, (14366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:57:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 14366 transitions. [2022-03-01 16:57:21,582 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 14366 transitions. Word has length 134 [2022-03-01 16:57:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:57:21,582 INFO L470 AbstractCegarLoop]: Abstraction has 7152 states and 14366 transitions. [2022-03-01 16:57:21,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:57:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 14366 transitions. [2022-03-01 16:57:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:57:21,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:57:21,584 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-03-01 16:57:21,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-01 16:57:21,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-01 16:57:21,785 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:57:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:57:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1570150843, now seen corresponding path program 16 times [2022-03-01 16:57:21,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:57:21,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754152989] [2022-03-01 16:57:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:57:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:57:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:57:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:57:22,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:57:22,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754152989] [2022-03-01 16:57:22,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754152989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:57:22,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992734620] [2022-03-01 16:57:22,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:57:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:57:22,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:57:22,898 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:57:22,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-01 16:57:23,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:57:23,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:57:23,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-01 16:57:23,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:57:23,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 11 treesize of output 7 [2022-03-01 16:57:23,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:23,986 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-03-01 16:57:24,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,474 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-03-01 16:57:24,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,650 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-03-01 16:57:24,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:57:24,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:57:24,964 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-03-01 16:57:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:57:24,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:57:28,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |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|)) (forall ((v_ArrVal_7045 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 (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|) .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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_7045 Int)) (= (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 (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| 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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_7045 Int)) (= (select (select (let ((.cse5 (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 .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_74| v_ArrVal_7045))) |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|))))) is different from false [2022-03-01 16:58:05,631 WARN L228 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:58:33,641 WARN L228 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:58:33,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:33,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:58:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:58:40,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992734620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:58:40,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:58:40,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-03-01 16:58:40,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670630351] [2022-03-01 16:58:40,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:58:40,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-01 16:58:40,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:58:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-01 16:58:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=683, Unknown=18, NotChecked=54, Total=870 [2022-03-01 16:58:40,609 INFO L87 Difference]: Start difference. First operand 7152 states and 14366 transitions. Second operand has 30 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:58:44,649 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ 28 |c_~#cache~0.offset|))) (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 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_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |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|)) (forall ((v_ArrVal_7045 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 (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|) .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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_7045 Int)) (= (select (select (let ((.cse6 (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 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= .cse7 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|) (<= .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-03-01 16:58:46,694 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |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|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |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|)) (forall ((v_ArrVal_7045 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 (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|) .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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_7045 Int)) (= (select (select (let ((.cse6 (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 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-01 16:58:48,778 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |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 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |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_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |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|)) (forall ((v_ArrVal_7045 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 (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|) .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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_7045 Int)) (= (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_74| v_ArrVal_7045))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_7045 Int)) (= (select (select (let ((.cse6 (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 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_7045))) |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_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= .cse7 |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|) (<= .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |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-03-01 16:58:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:58:51,445 INFO L93 Difference]: Finished difference Result 13163 states and 26441 transitions. [2022-03-01 16:58:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:58:51,445 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 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-03-01 16:58:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:58:51,461 INFO L225 Difference]: With dead ends: 13163 [2022-03-01 16:58:51,461 INFO L226 Difference]: Without dead ends: 13163 [2022-03-01 16:58:51,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=271, Invalid=1530, Unknown=21, NotChecked=340, Total=2162 [2022-03-01 16:58:51,462 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 1025 mSDsluCounter, 3712 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1320 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:58:51,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1025 Valid, 4139 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1198 Invalid, 0 Unknown, 1320 Unchecked, 3.4s Time] [2022-03-01 16:58:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2022-03-01 16:58:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 7168. [2022-03-01 16:58:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7155 states have (on average 2.0122990915443744) internal successors, (14398), 7167 states have internal predecessors, (14398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:58:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 14398 transitions. [2022-03-01 16:58:51,564 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 14398 transitions. Word has length 134 [2022-03-01 16:58:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:58:51,564 INFO L470 AbstractCegarLoop]: Abstraction has 7168 states and 14398 transitions. [2022-03-01 16:58:51,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:58:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 14398 transitions. [2022-03-01 16:58:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:58:51,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:58:51,574 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-03-01 16:58:51,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-03-01 16:58:51,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-01 16:58:51,775 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:58:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:58:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2036763393, now seen corresponding path program 17 times [2022-03-01 16:58:51,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:58:51,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598161056] [2022-03-01 16:58:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:58:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:58:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:58:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:58:52,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:58:52,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598161056] [2022-03-01 16:58:52,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598161056] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:58:52,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846167681] [2022-03-01 16:58:52,814 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:58:52,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:58:52,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:58:52,816 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:58:52,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-01 16:58:53,414 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 16:58:53,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:58:53,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 16:58:53,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:58:55,938 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-03-01 16:58:56,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:56,098 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-03-01 16:58:57,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,010 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-03-01 16:58:57,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-03-01 16:58:57,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:58:57,572 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-03-01 16:58:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:58:57,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:59:00,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:00,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:00,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:00,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:59:01,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846167681] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:59:01,637 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:59:01,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2022-03-01 16:59:01,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871385424] [2022-03-01 16:59:01,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:59:01,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 16:59:01,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:59:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 16:59:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:59:01,638 INFO L87 Difference]: Start difference. First operand 7168 states and 14398 transitions. Second operand has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:59:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:59:13,746 INFO L93 Difference]: Finished difference Result 8193 states and 16367 transitions. [2022-03-01 16:59:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:59:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 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-03-01 16:59:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:59:13,756 INFO L225 Difference]: With dead ends: 8193 [2022-03-01 16:59:13,756 INFO L226 Difference]: Without dead ends: 8193 [2022-03-01 16:59:13,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=849, Invalid=3311, Unknown=0, NotChecked=0, Total=4160 [2022-03-01 16:59:13,757 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 1745 mSDsluCounter, 5458 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 5921 SdHoareTripleChecker+Invalid, 4148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1449 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:59:13,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1745 Valid, 5921 Invalid, 4148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2526 Invalid, 0 Unknown, 1449 Unchecked, 7.6s Time] [2022-03-01 16:59:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8193 states. [2022-03-01 16:59:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8193 to 7096. [2022-03-01 16:59:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 7083 states have (on average 2.0124241140759564) internal successors, (14254), 7095 states have internal predecessors, (14254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:59:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 14254 transitions. [2022-03-01 16:59:13,865 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 14254 transitions. Word has length 134 [2022-03-01 16:59:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:59:13,865 INFO L470 AbstractCegarLoop]: Abstraction has 7096 states and 14254 transitions. [2022-03-01 16:59:13,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:59:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 14254 transitions. [2022-03-01 16:59:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:59:13,867 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:59:13,867 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-03-01 16:59:13,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-03-01 16:59:14,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:59:14,069 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:59:14,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:59:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash -468459355, now seen corresponding path program 18 times [2022-03-01 16:59:14,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:59:14,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369779870] [2022-03-01 16:59:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:59:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:59:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:59:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:59:15,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:59:15,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369779870] [2022-03-01 16:59:15,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369779870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:59:15,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381276993] [2022-03-01 16:59:15,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:59:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:59:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:59:15,167 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:59:15,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-01 16:59:15,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 16:59:15,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:59:15,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 16:59:15,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:59:16,443 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-03-01 16:59:16,884 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-03-01 16:59:17,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,464 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-03-01 16:59:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,657 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-03-01 16:59:17,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:17,864 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-03-01 16:59:18,401 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 16:59:18,402 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-03-01 16:59:18,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:18,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 16:59:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:59:18,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:59:21,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:21,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:59:22,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:22,662 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 18 treesize of output 12 [2022-03-01 16:59:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 16:59:23,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381276993] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 16:59:23,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 16:59:23,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 16:59:23,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624148715] [2022-03-01 16:59:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:59:23,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 16:59:23,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:59:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 16:59:23,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 16:59:23,315 INFO L87 Difference]: Start difference. First operand 7096 states and 14254 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:59:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:59:26,838 INFO L93 Difference]: Finished difference Result 9075 states and 18228 transitions. [2022-03-01 16:59:26,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:59:26,838 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 16:59:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:59:26,849 INFO L225 Difference]: With dead ends: 9075 [2022-03-01 16:59:26,849 INFO L226 Difference]: Without dead ends: 9075 [2022-03-01 16:59:26,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=213, Invalid=1767, Unknown=0, NotChecked=0, Total=1980 [2022-03-01 16:59:26,850 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 235 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:59:26,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 1720 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 629 Unchecked, 0.8s Time] [2022-03-01 16:59:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2022-03-01 16:59:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 7128. [2022-03-01 16:59:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7128 states, 7115 states have (on average 2.0123682361208712) internal successors, (14318), 7127 states have internal predecessors, (14318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:59:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 14318 transitions. [2022-03-01 16:59:26,931 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 14318 transitions. Word has length 134 [2022-03-01 16:59:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:59:26,931 INFO L470 AbstractCegarLoop]: Abstraction has 7128 states and 14318 transitions. [2022-03-01 16:59:26,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:59:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 14318 transitions. [2022-03-01 16:59:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 16:59:26,933 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:59:26,933 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-03-01 16:59:26,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-03-01 16:59:27,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-01 16:59:27,134 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 16:59:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:59:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -552304441, now seen corresponding path program 19 times [2022-03-01 16:59:27,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:59:27,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632278267] [2022-03-01 16:59:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:59:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:59:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:59:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:59:28,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:59:28,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632278267] [2022-03-01 16:59:28,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632278267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:59:28,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36978432] [2022-03-01 16:59:28,201 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:59:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:59:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:59:28,203 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:59:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-01 16:59:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:59:28,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:59:28,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:59:30,172 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-03-01 16:59:30,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:30,702 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-03-01 16:59:30,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:30,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:30,899 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-03-01 16:59:31,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:31,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:31,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:31,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:31,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:59:31,324 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-03-01 16:59:31,834 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-01 16:59:31,835 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-03-01 16:59:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 16:59:32,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:01:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:01:49,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36978432] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:01:49,988 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:01:49,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-03-01 17:01:49,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224963409] [2022-03-01 17:01:49,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:01:49,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 17:01:49,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:01:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 17:01:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1344, Unknown=56, NotChecked=0, Total=1560 [2022-03-01 17:01:49,989 INFO L87 Difference]: Start difference. First operand 7128 states and 14318 transitions. Second operand has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 17:01:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:01:58,485 INFO L93 Difference]: Finished difference Result 8205 states and 16399 transitions. [2022-03-01 17:01:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 17:01:58,485 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 17:01:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:01:58,496 INFO L225 Difference]: With dead ends: 8205 [2022-03-01 17:01:58,496 INFO L226 Difference]: Without dead ends: 8205 [2022-03-01 17:01:58,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 141.3s TimeCoverageRelationStatistics Valid=608, Invalid=2996, Unknown=56, NotChecked=0, Total=3660 [2022-03-01 17:01:58,497 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 1098 mSDsluCounter, 4467 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 4876 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-01 17:01:58,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1098 Valid, 4876 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1477 Invalid, 0 Unknown, 864 Unchecked, 4.7s Time] [2022-03-01 17:01:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2022-03-01 17:01:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 7184. [2022-03-01 17:01:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7184 states, 7171 states have (on average 2.0125505508297308) internal successors, (14432), 7183 states have internal predecessors, (14432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:01:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7184 states to 7184 states and 14432 transitions. [2022-03-01 17:01:58,589 INFO L78 Accepts]: Start accepts. Automaton has 7184 states and 14432 transitions. Word has length 134 [2022-03-01 17:01:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:01:58,590 INFO L470 AbstractCegarLoop]: Abstraction has 7184 states and 14432 transitions. [2022-03-01 17:01:58,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.9743589743589745) internal successors, (233), 40 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-03-01 17:01:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 7184 states and 14432 transitions. [2022-03-01 17:01:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:01:58,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:01:58,594 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-03-01 17:01:58,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-01 17:01:58,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:01:58,820 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 17:01:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:01:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 299090341, now seen corresponding path program 20 times [2022-03-01 17:01:58,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:01:58,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435492415] [2022-03-01 17:01:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:01:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:01:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:00,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:00,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435492415] [2022-03-01 17:02:00,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435492415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:00,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324044927] [2022-03-01 17:02:00,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 17:02:00,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:00,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:00,049 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:02:00,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-01 17:02:00,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 17:02:00,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:00,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:02:00,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:01,469 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-03-01 17:02:01,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 17:02:02,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:02,642 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-03-01 17:02:03,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,086 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-03-01 17:02:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,327 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-03-01 17:02:03,583 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:02:03,583 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-03-01 17:02:03,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:03,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 17:02:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 17:02:04,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:07,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:07,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:08,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:08,301 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 18 treesize of output 12 [2022-03-01 17:02:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 17:02:09,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324044927] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:09,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:02:09,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 17:02:09,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645982596] [2022-03-01 17:02:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:02:09,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:02:09,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:09,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:02:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 17:02:09,009 INFO L87 Difference]: Start difference. First operand 7184 states and 14432 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:12,761 INFO L93 Difference]: Finished difference Result 9047 states and 18152 transitions. [2022-03-01 17:02:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 17:02:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 17:02:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:12,772 INFO L225 Difference]: With dead ends: 9047 [2022-03-01 17:02:12,772 INFO L226 Difference]: Without dead ends: 9047 [2022-03-01 17:02:12,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 17:02:12,772 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 213 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:12,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1629 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 663 Unchecked, 0.6s Time] [2022-03-01 17:02:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9047 states. [2022-03-01 17:02:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9047 to 7188. [2022-03-01 17:02:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 7175 states have (on average 2.0125435540069687) internal successors, (14440), 7187 states have internal predecessors, (14440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 14440 transitions. [2022-03-01 17:02:12,853 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 14440 transitions. Word has length 134 [2022-03-01 17:02:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:12,854 INFO L470 AbstractCegarLoop]: Abstraction has 7188 states and 14440 transitions. [2022-03-01 17:02:12,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 14440 transitions. [2022-03-01 17:02:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:12,856 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:12,856 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-03-01 17:02:12,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-01 17:02:13,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:13,059 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 17:02:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash 964025461, now seen corresponding path program 21 times [2022-03-01 17:02:13,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:13,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813428590] [2022-03-01 17:02:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:14,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:14,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813428590] [2022-03-01 17:02:14,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813428590] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:14,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65567060] [2022-03-01 17:02:14,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 17:02:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:14,215 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:02:14,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-01 17:02:14,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 17:02:14,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:14,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:02:14,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:15,533 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-03-01 17:02:15,956 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-03-01 17:02:16,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:16,574 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-03-01 17:02:17,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,020 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-03-01 17:02:17,282 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:02:17,282 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-03-01 17:02:17,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-03-01 17:02:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:17,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 17:02:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 17:02:18,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:21,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:21,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:22,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:22,414 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 18 treesize of output 12 [2022-03-01 17:02:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 17:02:23,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65567060] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:23,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 17:02:23,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 38 [2022-03-01 17:02:23,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834284928] [2022-03-01 17:02:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:02:23,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-01 17:02:23,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:23,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-01 17:02:23,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 17:02:23,111 INFO L87 Difference]: Start difference. First operand 7188 states and 14440 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:26,556 INFO L93 Difference]: Finished difference Result 8959 states and 17988 transitions. [2022-03-01 17:02:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 17:02:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-01 17:02:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:26,569 INFO L225 Difference]: With dead ends: 8959 [2022-03-01 17:02:26,569 INFO L226 Difference]: Without dead ends: 8959 [2022-03-01 17:02:26,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 17:02:26,570 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 222 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:26,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 2180 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 793 Unchecked, 0.8s Time] [2022-03-01 17:02:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8959 states. [2022-03-01 17:02:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8959 to 7194. [2022-03-01 17:02:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7194 states, 7181 states have (on average 2.0125330733881075) internal successors, (14452), 7193 states have internal predecessors, (14452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7194 states to 7194 states and 14452 transitions. [2022-03-01 17:02:26,669 INFO L78 Accepts]: Start accepts. Automaton has 7194 states and 14452 transitions. Word has length 134 [2022-03-01 17:02:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:26,669 INFO L470 AbstractCegarLoop]: Abstraction has 7194 states and 14452 transitions. [2022-03-01 17:02:26,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7194 states and 14452 transitions. [2022-03-01 17:02:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:26,671 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:26,671 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-03-01 17:02:26,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-03-01 17:02:26,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-03-01 17:02:26,872 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 17:02:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 987143401, now seen corresponding path program 22 times [2022-03-01 17:02:26,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:26,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592231457] [2022-03-01 17:02:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:27,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:27,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592231457] [2022-03-01 17:02:27,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592231457] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:27,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262780248] [2022-03-01 17:02:27,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 17:02:27,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:27,916 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:02:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-01 17:02:28,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 17:02:28,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:28,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 17:02:28,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:30,177 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-03-01 17:02:30,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:30,692 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-03-01 17:02:31,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,079 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-03-01 17:02:31,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,436 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 17:02:31,436 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 37 treesize of output 42 [2022-03-01 17:02:31,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:31,627 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 17:02:31,627 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-03-01 17:02:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:31,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:34,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:34,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:34,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:34,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:35,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262780248] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:02:35,931 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:02:35,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2022-03-01 17:02:35,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221072980] [2022-03-01 17:02:35,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:02:35,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 17:02:35,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 17:02:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 17:02:35,932 INFO L87 Difference]: Start difference. First operand 7194 states and 14452 transitions. Second operand has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:02:41,983 INFO L93 Difference]: Finished difference Result 7485 states and 14951 transitions. [2022-03-01 17:02:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 17:02:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 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-03-01 17:02:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:02:41,993 INFO L225 Difference]: With dead ends: 7485 [2022-03-01 17:02:41,993 INFO L226 Difference]: Without dead ends: 7485 [2022-03-01 17:02:41,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=446, Invalid=2310, Unknown=0, NotChecked=0, Total=2756 [2022-03-01 17:02:41,994 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 1002 mSDsluCounter, 5653 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 6036 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1011 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:02:41,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1002 Valid, 6036 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1355 Invalid, 0 Unknown, 1011 Unchecked, 4.0s Time] [2022-03-01 17:02:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7485 states. [2022-03-01 17:02:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7485 to 7196. [2022-03-01 17:02:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 7183 states have (on average 2.0125295837393846) internal successors, (14456), 7195 states have internal predecessors, (14456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 14456 transitions. [2022-03-01 17:02:42,076 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 14456 transitions. Word has length 134 [2022-03-01 17:02:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:02:42,077 INFO L470 AbstractCegarLoop]: Abstraction has 7196 states and 14456 transitions. [2022-03-01 17:02:42,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.948717948717949) internal successors, (232), 40 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:02:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 14456 transitions. [2022-03-01 17:02:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:02:42,079 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:02:42,079 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-03-01 17:02:42,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-01 17:02:42,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:42,280 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 17:02:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:02:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -760264705, now seen corresponding path program 23 times [2022-03-01 17:02:42,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:02:42,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160364007] [2022-03-01 17:02:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:02:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:02:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:02:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:43,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:02:43,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160364007] [2022-03-01 17:02:43,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160364007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:02:43,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590994332] [2022-03-01 17:02:43,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 17:02:43,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:02:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:02:43,418 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:02:43,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-01 17:02:43,890 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-01 17:02:43,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:02:43,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:02:43,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:02:45,743 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-03-01 17:02:46,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,303 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-03-01 17:02:46,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,718 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-03-01 17:02:46,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:46,992 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-03-01 17:02:47,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:02:47,351 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 17:02:47,351 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-03-01 17:02:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:47,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:02:51,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:51,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 17:02:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:02:52,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590994332] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:02:52,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:02:52,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 40 [2022-03-01 17:02:52,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669200688] [2022-03-01 17:02:52,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:02:52,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 17:02:52,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:02:52,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 17:02:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 17:02:52,928 INFO L87 Difference]: Start difference. First operand 7196 states and 14456 transitions. Second operand has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 17:03:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:03:02,448 INFO L93 Difference]: Finished difference Result 8348 states and 16710 transitions. [2022-03-01 17:03:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 17:03:02,449 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 17:03:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:03:02,458 INFO L225 Difference]: With dead ends: 8348 [2022-03-01 17:03:02,458 INFO L226 Difference]: Without dead ends: 8348 [2022-03-01 17:03:02,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 243 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=658, Invalid=3002, Unknown=0, NotChecked=0, Total=3660 [2022-03-01 17:03:02,459 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 1505 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 5152 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-03-01 17:03:02,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1505 Valid, 5152 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1705 Invalid, 0 Unknown, 766 Unchecked, 5.2s Time] [2022-03-01 17:03:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2022-03-01 17:03:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 7256. [2022-03-01 17:03:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7256 states, 7243 states have (on average 2.0132541764462237) internal successors, (14582), 7255 states have internal predecessors, (14582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:03:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 14582 transitions. [2022-03-01 17:03:02,538 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 14582 transitions. Word has length 134 [2022-03-01 17:03:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:03:02,538 INFO L470 AbstractCegarLoop]: Abstraction has 7256 states and 14582 transitions. [2022-03-01 17:03:02,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.825) internal successors, (233), 41 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-03-01 17:03:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 14582 transitions. [2022-03-01 17:03:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-01 17:03:02,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:03:02,541 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-03-01 17:03:02,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-01 17:03:02,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:03:02,741 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-01 17:03:02,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:03:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1918444487, now seen corresponding path program 24 times [2022-03-01 17:03:02,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:03:02,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555261421] [2022-03-01 17:03:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:03:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:03:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:03:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-01 17:03:03,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:03:03,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555261421] [2022-03-01 17:03:03,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555261421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:03:03,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071745074] [2022-03-01 17:03:03,958 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 17:03:03,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:03:03,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:03:03,959 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:03:03,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-01 17:03:04,307 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-01 17:03:04,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 17:03:04,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-01 17:03:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:03:05,262 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-03-01 17:03:05,709 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-03-01 17:03:06,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,486 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-03-01 17:03:06,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,663 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-03-01 17:03:06,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:06,880 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-03-01 17:03:07,164 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 17:03:07,164 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-03-01 17:03:07,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 17:03:07,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-01 17:03:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-03-01 17:03:07,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-03-01 17:03:09,759 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 17:03:09,766 WARN L244 SmtUtils]: Removed 8 from assertion stack [2022-03-01 17:03:09,768 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-03-01 17:03:09,768 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 17:03:09,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-03-01 17:03:09,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:03:09,968 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-03-01 17:03:09,970 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-03-01 17:03:09,972 INFO L732 BasicCegarLoop]: Path program histogram: [39, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:03:09,974 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 17:03:09,974 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 17:03:09,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 05:03:09 BasicIcfg [2022-03-01 17:03:09,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 17:03:09,976 INFO L158 Benchmark]: Toolchain (without parser) took 840653.50ms. Allocated memory was 178.3MB in the beginning and 569.4MB in the end (delta: 391.1MB). Free memory was 125.0MB in the beginning and 332.6MB in the end (delta: -207.5MB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. [2022-03-01 17:03:09,976 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 143.7MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 17:03:09,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.01ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 124.8MB in the beginning and 199.5MB in the end (delta: -74.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-03-01 17:03:09,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.31ms. Allocated memory is still 240.1MB. Free memory was 199.5MB in the beginning and 196.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 17:03:09,976 INFO L158 Benchmark]: Boogie Preprocessor took 43.85ms. Allocated memory is still 240.1MB. Free memory was 196.9MB in the beginning and 194.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 17:03:09,976 INFO L158 Benchmark]: RCFGBuilder took 417.33ms. Allocated memory is still 240.1MB. Free memory was 194.2MB in the beginning and 178.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-01 17:03:09,976 INFO L158 Benchmark]: TraceAbstraction took 839670.47ms. Allocated memory was 240.1MB in the beginning and 569.4MB in the end (delta: 329.3MB). Free memory was 177.5MB in the beginning and 332.6MB in the end (delta: -155.1MB). Peak memory consumption was 175.2MB. Max. memory is 8.0GB. [2022-03-01 17:03:09,977 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.09ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 143.7MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 457.01ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 124.8MB in the beginning and 199.5MB in the end (delta: -74.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.31ms. Allocated memory is still 240.1MB. Free memory was 199.5MB in the beginning and 196.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.85ms. Allocated memory is still 240.1MB. Free memory was 196.9MB in the beginning and 194.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.33ms. Allocated memory is still 240.1MB. Free memory was 194.2MB in the beginning and 178.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 839670.47ms. Allocated memory was 240.1MB in the beginning and 569.4MB in the end (delta: 329.3MB). Free memory was 177.5MB in the beginning and 332.6MB in the end (delta: -155.1MB). Peak memory consumption was 175.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - TimeoutResultAtElement [Line: 939]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - TimeoutResultAtElement [Line: 939]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - TimeoutResultAtElement [Line: 936]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was analyzing trace of length 135 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 27ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 161 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 839.6s, OverallIterations: 76, TraceHistogramMax: 10, PathProgramHistogramMax: 39, EmptinessCheckTime: 0.2s, AutomataDifference: 216.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66830 SdHoareTripleChecker+Valid, 102.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66830 mSDsluCounter, 171838 SdHoareTripleChecker+Invalid, 93.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31623 IncrementalHoareTripleChecker+Unchecked, 148046 mSDsCounter, 2072 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72219 IncrementalHoareTripleChecker+Invalid, 105914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2072 mSolverCounterUnsat, 24056 mSDtfsCounter, 72219 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13192 GetRequests, 10427 SyntacticMatches, 31 SemanticMatches, 2734 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 29304 ImplicationChecksByTransitivity, 579.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7321occurred in iteration=51, InterpolantAutomatonStates: 1535, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 75 MinimizatonAttempts, 352072 StatesRemovedByMinimization, 71 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 578.0s InterpolantComputationTime, 15794 NumberOfCodeBlocks, 13853 NumberOfCodeBlocksAsserted, 255 NumberOfCheckSat, 18982 ConstructedInterpolants, 296 QuantifiedInterpolants, 154413 SizeOfPredicates, 829 NumberOfNonLiveVariables, 15514 ConjunctsInSsa, 2185 ConjunctsInUnsatCore, 172 InterpolantComputations, 59 PerfectInterpolantSequences, 35937/38545 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown